A modified lift-and-project procedure

Mathematical Programming, Series B

Volumn 79, Issue 1-3, 1997, Pages 19-31

  Balas, Egon ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Convexification; Disjunctive programming; Lifting; Projection

Indexed keywords

EID: 0141781162     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614309     Document Type: Article

References (14)

1. E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, MSRR #348, Carnegie Mellon University, July 1974.
2. E. Balas, Disjunctive programming, Annals of Discrete Mathematics 5 (1979) 3-51.
3. E. Balas, Disjunctive programming and a hierarchy of relaxations for discrete optimization problems, SIAM Journal on Algebraic and Discrete Methods 6 (1985) 466-485.
4. E. Balas, Enhancements of lift-and-project, GSIA, Carnegie Mellon University, January 1996.
5. E. Balas, S. Ceria and G. Cornuéjols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical 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, Management Science 42 (1996) 1229-1246.
7. E. Balas, S. Ceria, G. Cornuéjols and G. Pataki, Polyhedral methods for the maximum clique problem, in: D. Johnson and M. Trick, eds., Clique, Coloring and Satisfiability: The Second DIMACS Challenge (The American Mathematical Society, Providence, RI, 1996), 11-27.
8. R. Bixby, W. Cook, A. Cox and E. Lee, Computational experience with parallel mixed integer programming in a distributed environment, Rice University, June 1995, revised December 1996.
9. S. Ceria, Lift-and-project methods for mixed 0-1 programs, Ph.D. Dissertation, GSIA, Carnegie Mellon University, 1993.
10. S. Ceria and J. Soares, Convex programming for disjunctive optimization, G.S.B., Columbia University, November 1996.
11. L. Lovász and A. Schrijver, Cones of matrices and set functions and 0-1 optimization, SIAM Journal on Optimization 1 (1991) 166-190.
12. H. Sherali and W. Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM Journal on Discrete Mathematics 3 (1990) 411-430.
13. R.A. Stubbs and S. Mehrotra, A branch-and-cut method for 0-1 mixed convex programming, Dept. of IE, Northwestern University, Technical Report 96-01, January 1996.
14. S. Thienel, ABACUS: A Branch and Cut System, Doctoral Dissertation, Faculty of Mathematics and the Natural Sciences, University of Köln, 1995.