Lift-and-project for Mixed 0-1 programming: Recent progress

Discrete Applied Mathematics

Volumn 123, Issue 1-3, 2002, Pages 129-154

  Balas, Egon ^a   Perregaard, Michael ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cut generation; Disjunctive programming; Lift and project; Mixed 0 1 programming

Indexed keywords

CERIUM OXIDE; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING;

0-1 PROGRAMMING; COMPUTATIONAL RESULTS; CONVEXIFICATION; CUT GENERATION; DISJUNCTIVE PROGRAMMING; HIGHER-DIMENSIONAL; LIFT-AND-PROJECT; SOLUTION COMPONENTS;

INTEGER PROGRAMMING;

EID: 84867946795     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00340-7     Document Type: Article

References (27)

1. E. Balas, Disjunctive programming: properties of the convex hull of feasible points, Invited paper, with a foreword by G. Cornuéjols and W. Pulleyblank, Discrete Appl. Math. 89 (1998) 3-44 (originally MSRR# 348, Carnegie Mellon University, July 1974).
2. E Balas Disjunctive programming Ann. Discrete Math. 5 1979 3 51
3. E Balas Disjunctive programming and a hierarchy of relaxations for discrete optimization problems SIAM J. Algebraic Discrete Methods 6 1985 466 485
4. E Balas A modified lift-and-project procedure Math. Programming 79 1997 19 31
5. E Balas, S Ceria, and G Cornuéjols A lift-and-project cutting plane algorithm for mixed 0-1 programs Math. Programming 58 1993 295 324
6. E Balas, S Ceria, and G Cornuéjols Mixed 0-1 programming by lift-and-project in a branch-and-cut framework Manag. Sci. 42 1996 1229 1246
7. E. Balas, S. Ceria, G. Cornuéjols, G. Pataki, Polyhedral methods for the maximum clique problem, in: D. Johnson, M. Trick (Eds.), Clique, Coloring and Satisfiability: The Second DIMACS Challenge, The American Mathematical Society, Providence, RI, 1996, pp. 11-27.
8. E Balas, and R.G Jeroslow Strengthening cuts for mixed integer programs European J. Oper. Res. 4 1980 224 234
9. E Balas, J Tama, and J Tind Sequential convexification in reverse convex and disjunctive programming Math. Programming 44 1989 337 350
10. N Beaumont An algorithm for disjunctive programming European J. Oper. Res. 48 1990 362 371
11. R Bixby, W Cook, A Cox, and E Lee Computational experience with parallel mixed integer programming in a distributed environment Ann. Oper. Res. 90 1999 19 45
12. C Blair Two rules for deducing valid inequalities for 0-1 programs SIAM J. Appl. Math. 31 1976 614 617
13. C Blair Facial disjunctive programs and sequences of cutting planes Discrete Appl. Math. 2 1980 173 180
14. S Ceria, and G Pataki Solving integer and disjunctive programs by lift-and-project R.E Bixby, E.A Boyd, R.Z Rios-Mercado, IPCO VI Lecture Notes in Computer Science Vol. 1412 1998 Springer Berlin 271 283
15. S. Ceria, J. Soares, Disjunctive cuts for mixed 0-1 programming: duality and lifting, GSB, Columbia University, 1997.
16. S. Ceria, J. Soares, Convex programming for disjunctive optimization, GSB, Columbia University, 1997.
17. R.G Jeroslow Cutting plane theory: disjunctive methods Ann. Discrete Math. 1 1977 293 330
18. R.G Jeroslow Representability in mixed integer programming I: characterization results Discrete Appl. Math. 17 1987 223 243
19. R.G. Jeroslow, Logic based decision support: mixed integer model formulation, Ann. Discrete Math. 40 North-Holland, Amsterdam, 1989.
20. L Lovász, and A Schrijver Cones of matrices and set functions and 0-1 optimization SIAM J. Optim. 1 1991 166 190
21. G. Pataki, Private communications, March 2001.
22. H Sherali, and W Adams A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems SIAM J. Discrete Math. 3 1990 411 430
23. H Sherali, and C Shetty Optimization with disjunctive constraints Lecture Notes in Economics and Mathematical Systems Vol. 181 1980 Springer Berlin
24. R.A. Stubbs, S. Mehrotra, A branch-and-cut method for 0-1 mixed convex programming, Department of Industrial Engineering, Northwestern University, 1996.
25. S. Thienel, ABACUS: A branch-and-cut system, Doctoral Dissertation, Faculty of Mathematics and The Natural Sciences, University of Cologne, 1995.
26. M Turkay, and I.E Grossmann Disjunctive programming techniques for the optimization of process systems with discontinuous investment costs-multiple size regions Ind. Engng. Chem. Res. 35 1996 2611 2623
27. H.P Williams An alternative explanation of disjunctive formulations European J. Oper. Res. 72 1994 200 203