Dynamic knapsack sets and capacitated lot-sizing

Mathematical Programming, Series B

Volumn 95, Issue 1, 2003, Pages 53-69

  Loparic, Marko ^a,b   Marchand, Hugues ^b,c   Wolsey, Laurence A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Electrabel   (Belgium)

^c LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Knapsack sets; Lot sizing; Simultaneous lifting; Valid inequalities; Wagner Whitin costs

Indexed keywords

KNAPSACK SETS; LOT-SIZING; SIMULTANEOUS LIFTING; VALID INEQUALITIES; WAGNER-WHITIN COSTS;

COMPUTATION THEORY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

SET THEORY;

EID: 21044455829     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0341-y     Document Type: Article

References (21)

1. I. Barany, T.J. Van Roy and L.A. Wolsey, Uncapacitated lot sizing : the convex hull of solutions, Mathematical Programming Study 22, 32-43 (1984).
2. G. Belvaux and L.A. Wolsey, bc-prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems, Management Science 46, 724-738 (2000).
3. G.R. Bitran and H.H. Yanasse, Computational complexity of the capacitated lot-sizing problem, Managemenl Science 28, 1174-1186 (1982).
4. M. Constantino, A cutting plane approach to capacitated lot-sizing with start-up costs, Mathematical Programming 75 353-376 (1996).
5. C. Cordier, H. Marchand, R. Laundy and L.A. Wolsey, be - opt: A Branch-and-Cut Code for Mixed Integer Programs, Mathematical Programming 86, 335-354 (1999).
6. B. Fleischmann, The Discrete Lot-Sizing and Scheduling Problem, European Journal of Operations Research 44, 337-348 (1990).
7. K. Fukuda and A. Prodon, Double Description method revisited, Combinatorics and Computer Science, Lectue Notes in Computer Science no. 1120, Springer Verlag (1996).
8. O. Günlük and Y. Pochet, Mixing mixed integer inequalities, Mathematical Programming 90, 429-458 (2001).
9. Z. Gu, G.L. Nemhauser and M.W.P. Savelsbergh, Sequence Independent Lifting, Journal of Combinatorial Optimization 4, 109-129 (2000).
10. J.M.Y. Leung, T.L. Magnanti and R. Vachani, Facets and Algorithms for Capacitated Lot-Sizing, Mathematical Programming 45, 331-359 (1989).
11. H. Marchand, A Polyhedral study of the mixed knapsack set and its use to solve mixed integer programs, Ph.D. Thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, (1998).
12. H. Marchand and L.A. Wolsey, The 0-1 knapsack problem with a single continuous variable, Mathematical Programming 85, 15-33 (1999).
13. H. Marchand and L.A. Wolsey, Aggregation and Mixed Integer Rounding to solve MIPs, Operations Research 49, 363-371 (2001).
14. A. Miller, G.L. Kemhauser and M.W.P. Savelsbergh, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, European J. of Operational Research 125, 298-315 (2000).
15. Y. Pochet, Valid inequalities and separation for capacitated economic lot-sizing, Operations Research Letters 7, 109-116, 1988.
16. Y. Pochet and L.A.Wolsey, Lot-Sizing with Constant Batches: Formulation and Valid Inequalities, Mathematics of Operations Research 18, 767-785 (1993).
17. Y. Pochet and L.A. Wolsey, Polyhedra for Lot-Sizing with Wagner-Whitin Costs, Mathematical Programming 67, 297-324 (1994).
18. T.J. Van Roy and L.A. Wolsey, Solving Mixed 0-1 Problems by Automatic Reformulation, Operations Research 35, 45-57 (1987).
19. H.M. Wagner and T.M. Whitin, Dynamic Version of the Economic Lot Size Model, Management Science 5, 89-96 (1958).
20. L.A. Wolsey, Valid Inequalities and Superadditivity for 0/1 Integer Programs, Mathematics of Operations Research 2, 66-77 (1977).
21. XPRESS-MP Extended Modelling and Optimisation Subroutine Library, Reference Manual, Release 11, Dash Associates, Blisworth House, Blisworth, Northants NN73BX, UK (1999).