A lift-and-project cutting plane algorithm for mixed 0–1 programs

E. Balas, “Intersection cuts — A new type of cutting planes for integer programming,”Operations Research 19 (1971) 19–39.

E. Balas, “Intersection cuts for disjunctive constraints,” MSRR No. 330, Carnegie Mellon University (Pittsburgh, PA, 1974).

E. Balas, “Disjunctive Programming: Properties of the convex hull of feasible points,” MSRR No. 348, Carnegie Mellon University (Pittsburgh, PA, 1974).

E. Balas, “Disjunctive Programming,”Annals of Discrete Mathematics 5 (1979) 3–51.

E. Balas, “Disjunctive Programming and a hierarchy of relaxations for discrete optimization problems,”SIAM Journal on Algebraic and Discrete Methods 6 (1985) 466–486.

E. Balas and R. Jeroslow, “Strengthening cuts for mixed integer programs,”European Journal of Operations Research 4(4) (1980) 224–234.

E. Balas and C. Martin, “Pivot and complement — A heuristic for 0–1 programming,”Management Science 26(1) (1980) 86–96.

E. Balas, J. Tama and J. Tind, “Sequential convexification in reverse convex and disjunctive programming,”Mathematical Programming 44 (1989) 337–350.

B. Bouvier and G. Messoumian, “Programmes linéaires en variables bivalentes — Algorithme de Balas,” Université de Grenoble (Grenoble, France, 1965).

C. Carpaneto and P. Toth, “Some new branching and bounding criteria for the asymmetric traveling salesman problem,”Management Science 26(7) (1980) 736–743.

H. Crowder, E. Johnson, M. Padberg, “Solving large-scale zero–one linear programming problems,”Operations Research 31(5) (1983) 803–834.

M. Fischetti and P. Toth, “An additive bounding procedure for the asymmetric traveling salesman problem,”Mathematical Programming 53(2) (1992) 173–197.

F. Glover, “Convexity cuts and cut search,”Operations Research 21 (1973) 123–134.

R. Gomory, “An algorithm for the mixed integer problem,” RM-2597, The Rand Corporation (Santa Monica, CA, 1960).

R. Jeroslow, “A cutting plane game for facial disjunctive programs,”SIAM Journal on Control and Optimization 18(3) (1980) 264–280.

C. Lemke and K. Spielberg, “A capital budgeting heuristic algorithm using exchange operations,”AIEE Transactions 6 (1974) 143–150.

L. Lovász and A. Schrijver, “Cones of matrices and set-functions and 0–1 optimization,”SIAM Journal on Optimization 1(2) (1991) 166–190.

M. Padberg and G. Rinaldi, “Optimization of a 537-city TSP by branch and cut,”Operations Research Letters 6 (1987) 1–8.

C. Petersen, “Computational experience with variants of the Balas algorithm applied to the selection of R&D projects,”Management Science 13 (1967) 736–750.

B. Repetto, personal communication (1991).

H. Salkin,Integer Programming (Addison-Wesley, Reading, MA, 1975).

H. Sherali and W. Adams, “A hierarchy of relaxations and convex hull representations for mixedinteger zero–one programming problems,” Technical Report, Virginia Tech (Blacksburg, VA, 1989).

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(3) (1990) 411–430.

T. Van Roy and L. Wolsey, “Solving mixed integer programming problems using automatic reformulation,”Operations Research 35(1) (1987) 45–47.

W. White, “On Gomory's mixed integer algorithm,” Senior Thesis, Department of Mathematics, Princeton University (Princeton, NJ, 1961).