Generating cuts from multiple-term disjunctions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 348-360

  Perregaard, Michael ^a   Balas, Egon ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING;

CLASSICAL APPROACH; COMPUTATIONAL RESULTS; EXTRA VARIABLES; LIFT-AND-PROJECT; LINEAR PROGRAMS; TRADITIONAL APPROACHES;

INTEGER PROGRAMMING;

EID: 84947266045     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45535-3_27     Document Type: Article

References (7)

1. E. Balas, Disjunctive Programming, Annals of Discrete Mathematics, 5 (1979) 3-51.
2. E. Balas, Disjunctive Programming: Properties of the Convex Hull of Feasible Points, Invited paper in Discrete Applied Mathematics, 89 (1998) 1-44.
3. E. Balas, S. Ceria, G. Cornuejols, A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs, Mathematical Programming, 58 (1993) 295-324.
4. E. Balas, S. Ceria, G. Cornuejols, Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework, Management Science, 42 (1996) 1229-1246.
5. E. Balas, M. Perregaard, Lift and Project for Mixed 0-1 Programming: Recent Progress, MSRR No. 627, September 1999, Graduate School of Industrial Administration, Carnegie Mellon University.
6. E. Balas, M. Perregaard, A Precise Correspondence Between Lift-and-Project Cuts, Simple Disjunctive Cuts, and Mixed Integer Gomory Cuts for 0-1 Programming, MSRR No. 631, August 2000, Graduate School of Industrial Administration, Carnegie Mellon University
7. S. Ceria, G. Pataki, Solving Integer and Disjunctive Programs by Lift-and-Project, in R.E. Bixby, E.A. Boyd and R.Z. Rios-Mercado (editors), IPCO VI, Lecture Notes in Computer Science 1412, Springer, (1998) 271-283.