Mixing MIR inequalities with two divisible coefficients

Mathematical Programming

Volumn 123, Issue 2, 2010, Pages 451-483

  Constantino, Miguel ^a   Miller, Andrew J ^b   Van Vyve, Mathieu ^c  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c N SIDE SA   (Belgium)

Author keywords

Mathematics Subject Classification (2000): 90C11

Indexed keywords

CLOSED FORM; CONVEX HULL; EXTENDED FORMULATIONS; EXTREME POINTS; INTEGER VARIABLES; LOWER BOUNDS; MIXED INTEGER LINEAR PROGRAM; MIXED-INTEGER ROUNDING; MIXING SET; POLYHEDRAL STUDIES; POLYNOMIAL SIZE; PRODUCTION PLANNING; START-UPS; SUBJECT CLASSIFICATION; VALID INEQUALITY;

COMPUTATIONAL GEOMETRY; PRODUCTION CONTROL;

INTEGER PROGRAMMING;

EID: 77949540665     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-009-0266-9     Document Type: Article

References (18)

1. A. Agra M.F. Constantino 2006 Description of 2-integer continuous knapsack polyhedra Discrete Optim. 3 95 110 1146.90485 10.1016/j.disopt.2005.10. 008 2224978
2. A. Agra M.F. Constantino 2007 Lifting two-integer knapsack inequalities Math. Program. 109 1 115 154 05131062 10.1007/s10107-006-0705-9 2294037
3. E. Balas 1979 Disjunctive programming Annal. Discrete Math. 5 3 51 0409.90061 10.1016/S0167-5060(08)70342-X 558566
4. Conforti, M., Zambelli, G.: The mixing set with divisible capacities: a simple approach. Working Paper, 2008
5. Conforti M., Di Summa M., Wolsey L.A.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) IPCO. Lecture Notes in Computer Science, vol. 5035, pp. 435-449. Springer, Heidelberg (2008). ISBN 978-3-540-68886-0
6. Constantino, M.: A Polyhedral Approach to Production Planning Models: Start-up Costs and Times, and Lower Bounds on Production. PhD thesis, Faculté des Sciences, Université Catholique de Louvain, Belgium (1995)
7. M. Constantino 1998 Lower bounds in lot-sizing models: a polyhedral study Math. Oper. Res. 23 101 118 0977.90029 10.1287/moor.23.1.101 1606454
8. Di Summa, M.: The mixing set with divisible capacities. Working Paper, 2007
9. Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation, 1960
10. O. Günlük Y. Pochet 2001 Mixing MIR inequalities for mixed integer programs Math. Program. 90 429 258 1041.90033 10.1007/PL00011430 1832218
11. A.J. Miller L.A. Wolsey 2003 Tight formulations for some simple mixed integer programs and convex objective integer programs Math. Program. B 98 73 88 1047.90035 10.1007/s10107-003-0397-3 2019368
12. Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
13. Y. Pochet L.A. Wolsey 1993 Lot-sizing with constant batches: formulations and valid inequalities Math. Oper. Res. 18 767 785 0808.90058 10.1287/moor.18.4.767 1251679
14. Y. Pochet L.A. Wolsey 1994 Polyhedra for lot-sizing with Wagner-Whitin costs Math. Program. 67 297 323 10.1007/BF01582225 1307981
15. Van Vyve, M.: A Solution Approach of Production Planning Problems based on Compact Formulations for Single-Item Lot-Sizing Models. PhD thesis, CORE, Université Catholique de Louvain, Belgium (2003)
16. Zhao, M., de Farias, I.R.: The mixing-MIR set with two nondivisible capacities. Industrial and Systems Engineering, University of Buffalo (2007a, submitted)
17. Zhao, M., de Farias, I.R.: The mixing-mir set with divisible capacities. Math. Programm. (2007b, in press)
18. Zhao, M., de Farias, I.R.: A note on the continuous mixing polyhedron. Industrial and Systems Engineering, University of Buffalo (2007c, submitted)