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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4513 LNCS, Issue , 2007, Pages 454-468

  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

Approximation algorithms; Integer programming; Polyhedral combinatorics; Randomized algorithms; Scheduling theory and algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; INVENTORY CONTROL; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

INVENTORY MODELS; ORDERING COSTS; POLYHEDRAL COMBINATORICS; RANDOMIZED ALGORITHMS; SCHEDULING THEORY;

APPROXIMATION ALGORITHMS;

EID: 38049074259     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_34     Document Type: Conference Paper

References (19)

1. K. Aardal. Capacitated facility location: separation algorithms and computational experience. Mathematical Programming, 81:149-175, 1998.
2. K. Aardal, Y. Pochet, and L. A. Wolsey. Capacitated facility location: valid inequalities and facets. Mathematics of Operations Research, 20:562-582, 1995.
3. S. Anily and M. Tzur. Shipping multiple-items by capacitated vehicles - an optimal dynamic programming approach. Transportation Science, 39:233-248, 2005.
4. S. Anily, M. Tzur, and L. A. Wolsey. Multi-item lot-sizing with joint set-up cost. Technical Report 2005/70, CORE, 2005. Working paper.
5. A. Atamtürk and D. Rajan. On splittable and unsplittable flow capacity network design arc-set polyhedra. Mathematical Programming, 92:315-333, 2002.
6. G. R. Bitran and H. H. Yanasee. Computational complexity of the capacitated lot-size problem. Management Science, 28:1174-1186, 1982.
7. T. Carnes and D. B. Shmoys. A primal-dual 2-approximation algorithm the single-demand fixed-charge minimum-cost flow problem. Working paper, 2006.
8. R. D. Carr, L. K. Fleischer, V. J. Leung, and C. A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Proceedings of the 11th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2000.
9. A. Federgruen and J. Meissner. Probabilistic analysis of multi-item capacitated lot sizing problems. Working paper, 2004.
10. A. Federgruen, J. Meissner, and M. Tzur. Progressive interval heuristics for the multi-item capacitated lot sizing problem. To appear in Operations Research, 2003.
11. M. Florian, J. K. Lenstra, and A. H. G. Rinooy Kan. Deterministic production planning: Algorithms and complexity. Management Science, 26:669-679, 1980.
12. R. Levi, R. O. Roundy, and D. B. Shmoys. Primal-dual algorithms for deterministic inventory problems. Mathematics of Operations Research, 31:267-284, 2006.
13. R. Levi, R. O. Roundy, D. B. Shmoys, and M. Sviridenko. First constant approximation algorithm for the single-warehouse multi-retailer problem. Under revision in Management Science, 2004.
14. T. L. Magnanti, P. Mirchandani, and R. Vachani. The convex hull of two core capacitated network design problems. Mathematical Programming, 60:233-250, 1993.
15. G. Nemhauser and L. A. Wolsey. Integer Programming and Combinatorial Optimization. Wiley, 1990.
16. M. W. Padberg, T. J. V. Roy, and L. A. Wolsey. Valid inequalities for fixed charge problems. Operations Research, 33:842-861, 1985.
17. Y. Pochet and L. A. Wolsey. Lot-sizing with constant batches: Formulation and valid inequalities. Mathematics of Operations Research, 18:767-785, 1993.
18. Y. Pochet and L. A. Wolsey. Production Planning by Mixed Integer Programming. Springer Verlag, 2006.
19. C. P. M. van Hoesel and A. P. M. Wagelmans. Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Mathematics of Operations Research, 26:339-357, 2001.