Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities

Mathematics of Operations Research

Volumn 33, Issue 2, 2008, Pages 461-474

  Levi, Retsef ^a   Lodi, Andrea ^b   Sviridenko, Maxim ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Algorithms; Approximation; Flow cover inequalities; Inventory management

Indexed keywords

A-PRIORI; APPROXIMATION; CONSTANT APPROXIMATION ALGORITHMS; FACILITY LOCATIONS; FEASIBLE SOLUTIONS; FINITE PLANNING HORIZONS; FLOW-COVER INEQUALITIES; HOLDING COSTS; INTEGER SOLUTIONS; INVENTORY MANAGEMENT; INVENTORY MODELS; LOT-SIZING PROBLEMS; LP RELAXATIONS; MULTI ITEMS; ON THE FLIES; ON TIME; OPTIMAL COSTS; OPTIMAL SOLUTIONS; OPTIMALITY; ORDERING COSTS; POLYNOMIAL-TIME; STRONGLY NP-HARD; TIME DEPENDENTS;

COSTS; FACILITIES; INTEGER PROGRAMMING; INVENTORY CONTROL; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 61349194530     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0305     Document Type: Article

References (23)

1. Aardal, K. 1998. Capacitated facility location: Separation algorithms and computational experience. Math. Programming 81 149-175.
2. Aardal, K., Y. Pochet, L. A. Wolsey. 1995. Capacitated facility location: Valid inequalities and facets. Math. Oper: Res. 20 562-582.
3. Anily, S., M. Tzur. 2005. Shipping multiple-items by capacitated vehicles - An optimal dynamic programming approach. Transportation Sci. 39 233-248.
4. Anily, S., M. Tzur, L. A. Wolsey. 2005. Multi-item lot-sizing with joint set-up cost. Math. Programming. Forthcoming.
5. Atamtürk, A., D. Rajan. 2002. On splittable and unsplittable flow capacity network design arc-set polyhedra. Math. Programming 92 315-333.
6. Bitran, G. R., H. H. Yanasee. 1982. Computational complexity of the capacitated lot-size problem. Management Sci. 28 1174-1186.
7. Carnes, T., D. B. Shmoys. 2006. A primal-dual 2-approximation algorithm the single-demand fixed-charge minimum-cost flow problem. Working paper.
8. Carnes, T., D. Shmoys. 2008. A primal-dual schema for capacitated covering problems. A. Lodi, A. Panconesi, G. Rinaldi, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 5035, Springer, Berlin, 288-302.
9. Care, R. D., L. K. Fleischer, V. J. Leung, C. A. Phillips. 2000. Strengthening integrality gaps for capacitated network design and covering problems. Proc. 11th ACM/SIAM Sympos. Discrete Algorithms (SODA), 106-115.
10. Even, G., R. Levi, D. Rawitz, B. Schieber, S. Shahar, M. Sviridenko. 2008. Algorithms for capacitated rectangle stabbing and lot-sizing with joint set-up costs. Trans. Algorithms. Forthcoming.
11. Federgruen, A., J. Meissner. 2004. Probabilistic analysis of multi-item capacitated lot sizing problems. Working paper.
12. Federgruen, A., J. Meissner, M. Tzur. 2007. Progressive interval heuristics for the multi-item capacitated lot sizing problem. Oper. Res. 55 490-502.
13. Florian, M., J. K. Lenstra, A. H. G. Rinooy Kan. 1980. Deterministic production planning: Algorithms and complexity. Management Sci. 26 669-679.
14. Garey, M., D. S. Johnson. 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco.
15. Leung, J., T. Magnanti. 1989. Valid inequalities and facets of the capacitated plant location problem. Math. Programming 44 271-291.
16. Levi, R., R. O. Roundy, D. B. Shmoys. 2006. Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31 267-284.
17. Levi, R., R. O. Roundy, D. B. Shmoys, M. Sviridenko. 2008. First constant approximation algorithm for the single-warehouse multi-retailer problem. Management Sci 54(4) 762-776.
18. Magnanti, T. L., P. Mirchandani, R. Vachani. 1993. The convex hull of two core capacitated network design problems. Math. Programming 60 233-250.
19. Nemhauser, G., L. A. Wolsey. 1988. Integer Programming and Combinatorial Optimization. Wiley-Interscience, New York.
20. Padberg, M. W., T. J. V. Roy, L. A. Wolsey. 1985. Valid inequalities for fixed charge problems. Oper. Res. 33 842-861.
21. Pochet, Y., L. A. Wolsey. 1993. Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. 18 767-785.
22. Pochet, Y., L. A. Wolsey. 2006. Production Planning by Mixed Integer Programming. Springer-Verlag, Berlin.
23. van Hoesel, C. P. M., A. P. M. Wagelmans. 2001. Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26 339-357.