Valid inequalities for MIPs and group polyhedra from approximate liftings

Mathematical Programming

Volumn 118, Issue 2, 2009, Pages 253-277

  Richard, Jean Philippe P ^a   Li, Yanjun ^b   Miller, Lisa A ^c  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

^b PURDUE UNIVERSITY   (United States)

^c University of Minnesota   (United States)

Author keywords

Approximate lifting; Group problem; Integer programming; Polyhedral theory

Indexed keywords

DYNAMIC PROGRAMMING; PLASMA WAVES; PROGRAMMING THEORY;

APPROXIMATE LIFTING; BUILDING BLOCKS; GROUP PROBLEM; LIFTING PROCEDURES; LIFTING SCHEMES; MIXED INTEGER PROGRAMS; POLYHEDRAL THEORY; SIMPLE DERIVATIONS; VALID INEQUALITIES;

INTEGER PROGRAMMING;

EID: 58149484535     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0190-9     Document Type: Article

References (24)

1. J. Aráoz L. Evans R.E. Gomory E.L. Johnson 2003 Cyclic group and knapsack facets Math. Program. 96 2 377 408
2. A. Atamtürk 2004 Sequence independent lifting for mixed-integer programming Oper. Res. 52 487 490
3. Bixby R.E., Fenelon M., Gu Z., Rothberg E. and Wunderling R. (2000). MIP: Theory and practice-closing the gap. In: Powell, M.J.D. and Scholtes, S. (eds) System Modelling and Optimization: Methods, Theory and Applications, pp 19-49. Kluwer, Dordrecht
4. Bixby R.E., Gu Z., Rothberg E. and Wunderling R. (2004). Mixed integer programming: a progress report. In: Grotschel, M. (eds) The Sharpest Cut: the Impact of Manfred Padberg and His Work, pp 309-326. MPS/SIAM Series on Optimization, SIAM, Philadelphia
5. V. Chvátal 1973 Edmonds polytopes and a hierarchy of combinatorial problems Discret. Math. 4 305 337
6. G. Cornuéjols Y. Li D. Vandenbussche 2003 K-cuts: a variation of Gomory mixed integer cuts from the LP tableau INFORMS J. Comput. 15 385 396
7. S. Dash O. Günlük 2006 Valid inequalities based on the interpolation procedure Math. Program. 106 111 136
8. Dey, S., Richard, J.-P.P., Li, Y., Miller, L.A.: On the extreme inequalities of infinite group problems. Tech. rep. (2006). http://www. optimization-online.org/DB-HTML/2006/04/1356.html
9. Evans, L.: Cyclic group and knapsack facets with applications to cutting planes. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology (2002)
10. Gomory, R.E.: An algorithm for the mixed integer problem. Tech. Rep. RM-2597, RAND Corporation (1960)
11. R.E. Gomory 1969 Some polyhedra related to combinatorial problems Linear Algebra Appl. 2 451 558
12. R.E. Gomory E.L. Johnson 1972 Some continuous functions related to corner polyhedra i Math. Program. 3 23 85
13. R.E. Gomory E.L. Johnson 1972 Some continuous functions related to corner polyhedra ii Math. Program. 3 359 389
14. R.E. Gomory E.L. Johnson 2003 T-space and cutting planes Math. Program. 96 2 341 375
15. R.E. Gomory E.L. Johnson L. Evans 2003 Corner polyhedra and their application to cutting planes Math. Program. 96 2 321 339
16. R.E. Gomory E.L. Johnson L. Evans 2003 Corner polyhedra and their connection with cutting planes Math. Program. 96 321 339
17. Z. Gu G.L. Nemhauser M.W.P. Savelsbergh 2000 Sequence independent lifting J. Comb. Optim. 4 109 129
18. E.L. Johnson 1974 On the group problem for mixed integer programming Math. Program. Study 2 137 179
19. Miller, L.A., Li, Y., Richard, J.-P.P.: New facets for finite and infinite group problems from approximate lifting. Tech. rep., (2006) http://www.optimization-online.org/DB-HTML/2006/05/1394.html
20. M.W. Padberg 1973 On the facial structure of set packing polyhedra Math. Program. 5 199 215
21. J.-P.P. Richard I.R. de Farias G.L. Nemhauser 2003 Lifted inequalities for 0-1 mixed integer programming : Basic theory and algorithms Math. Program. 98 89 113
22. J.-P.P. Richard I.R. de Farias G.L. Nemhauser 2003 Lifted inequalities for 0-1 mixed integer programming: superlinear lifting Math. Program. 98 115 143
23. L.A. Wolsey 1976 Facets and strong valid inequalities for integer programs Oper. Res. 24 367 372
24. L.A. Wolsey 1977 Valid inequalities and superadditivity for 0-1 integer programs Math. Oper. Res. 2 66 77