Narrow search
Showing 1 - 10 of 401
Cover Image
Constant approximation algorithm for nonuniform capacitated multi-item lot sizing via strong covering inequalities
Li, Shi - In: Mathematics of operations research 45 (2020) 3, pp. 947-965
Persistent link: https://www.econbiz.de/10012293362
Cover Image
Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
Levi, Retsef; Lodi, Andrea; Sviridenko, Maxim - In: Mathematics of operations research 33 (2008) 2, pp. 461-474
Persistent link: https://www.econbiz.de/10003732456
Cover Image
A unifying approximate dynamic programming model for the economic lot scheduling problem
Adelman, Daniel; Barz, Christiane - In: Mathematics of operations research 39 (2014) 2, pp. 374-402
Persistent link: https://www.econbiz.de/10010384203
Cover Image
Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
Gayon, Jean-Philippe; Massonnet, Guillaume; Rapine, … - In: Mathematics of operations research 42 (2017) 3, pp. 854-875
Persistent link: https://www.econbiz.de/10011742538
Cover Image
On optimal policies for production-inventory systems with compound Poisson demand and setup costs
Foreest, Nicky D. van; Wijngaard, Jacob - In: Mathematics of operations research 39 (2014) 2, pp. 517-532
Persistent link: https://www.econbiz.de/10010384183
Cover Image
From cost sharing mechanisms to online selection problems
Elmachtoub, Adam N.; Levi, Retsef - In: Mathematics of operations research 40 (2015) 3, pp. 542-557
Persistent link: https://www.econbiz.de/10011338704
Cover Image
The power of preemption on unrelated machines and applications to scheduling orders
Correa, José R.; Skutella, Martin; Verschae, José - In: Mathematics of operations research 37 (2012) 2, pp. 379-398
Persistent link: https://www.econbiz.de/10009562356
Cover Image
Inverse polynomial optimization
Lasserre, Jean-Bernard - In: Mathematics of operations research 38 (2013) 3, pp. 418-436
Persistent link: https://www.econbiz.de/10009787380
Cover Image
On the hardest problem formulations for the 0/1 Lasserre hierarchy
Kurpisz, Adam; Leppänen, Samuli; Mastrolilli, Monaldo - In: Mathematics of operations research 42 (2017) 1, pp. 135-143
Persistent link: https://www.econbiz.de/10011654587
Cover Image
A geometrical characterization of multidimensional Hausdorff polytopes with applications to exit time problems
Helmes, Kurt; Röhl, Stefan - In: Mathematics of operations research 33 (2008) 2, pp. 315-326
Persistent link: https://www.econbiz.de/10003732432