Elementary closures for integer programs

In integer programming, the elementary closure associated with a family of cuts is the convex set defined by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory's fractional cuts, three versions of Gomory's mixed integer cuts, two versions of intersection cuts and their strengthened forms, Chvatal cuts, MIR cuts, lift-and-project cuts without and with strengthening, two versions of disjunctive cuts, Sherali-Adams cuts and Lovasz-Schrijver cuts with positive semi-definiteness constraints.

[1]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[2]  D. R. Fulkerson,et al.  Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems , 1974 .

[3]  E. Balas,et al.  Strengthening cuts for mixed integer programs , 1980 .

[4]  E. Balas.  DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .

[5]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[6]  Friedrich Eisenbrand,et al.  Cutting Planes and the Elementary Closure in Fixed Dimension , 2001, Math. Oper. Res..

[7]  William J. Cook,et al.  On the Matrix-Cut Rank of Polyhedra , 2001, Math. Oper. Res..

[8]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.

[9]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[10]  Friedrich Eisenbrand,et al.  NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..

[11]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[12]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[13]  Ralph E. Gomory,et al.  INTEGER PROGRAMMING AND PRICING , 1960 .

[14]  Ralph E. Gomory,et al.  Solving linear programming problems in integers , 1960 .

[15]  Michel X. Goemans,et al.  When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? , 2001, Math. Oper. Res..

[16]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[17]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[18]  William J. Cook,et al.  Chvátal closures for mixed integer programming problems , 1990, Math. Program..

[19]  Laurence A. Wolsey,et al.  Cutting planes in integer and mixed integer programming , 2002, Discret. Appl. Math..

[20]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[21]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[22]  Egon Balas,et al.  A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..

[23]  Charles Eugene Blair.  Two Rules for Deducing Valid Inequalities for 0-1 Problems , 1976 .

[24]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[25]  Robert G. Jeroslow,et al.  Cutting-Plane Theory: Disjunctive Methods , 1977 .

[26]  C. Burdet,et al.  On cutting planes , 1973 .

[27]  Egon Balas,et al.  Polyhedral methods for the maximum clique problem , 1994, Cliques, Coloring, and Satisfiability.

[28]  Friedrich Eisenbrand,et al.  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* , 2003, Comb..

[29]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .