Mixed Integer Rounding Cuts and Master Group Polyhedra

We survey recent research on mixed-integer rounding (MIR) inequalities and a generalization, namely the two-step MIR inequalities defined by Dash and Gunluk (2006). We discuss the master cyclic group polyhedron of Gomory (1969) and discuss how other subadditive inequalities, similar to MIR inequalities, can be derived from this polyhedron. Recent numerical experiments have shed much light on the strength of MIR inequalities and the closely related Gomory mixedinteger cuts, especially for the MIP instances in the MIPLIB 3.0 library, and we discuss these experiments and their outcomes. Balas and Saxena (2007), and independently, Dash, Gunluk and Lodi (2007), study the strength of the MIR closure of MIPLIB instances, and we explain their approach and results here. We also give a short proof of the well-known fact that the MIR closure of a polyhedral set is a polyhedron. Finally, we conclude with a survey of the complexity of cutting-plane proofs which use MIR inequalities. This survey is based on a series of 5 lectures presented at the Seminaire de mathematiques superieures, of the NATO Advanced Studies Institute, held in the University of Montreal, from June 19-30, 2006.

[1]  Kent Andersen,et al.  Split closure and intersection cuts , 2002, Math. Program..

[2]  M. Minoux,et al.  Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation , 2005, Discret. Optim..

[3]  Sanjeeb Dash,et al.  Two-Step MIR Inequalities for Mixed Integer Programs , 2010, INFORMS J. Comput..

[4]  Lisa Evans,et al.  Cyclic group and knapsack facets with applications to cutting planes , 2002 .

[5]  Ricardo Fukasawa,et al.  On the exact separation of mixed integer knapsack cuts , 2007, Math. Program..

[6]  P. Pudlák.  Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .

[7]  Sanjeeb Dash,et al.  Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs , 2005, Math. Oper. Res..

[8]  Andrea Lodi,et al.  Strengthening Chvátal-Gomory cuts and Gomory fractional cuts , 2002, Oper. Res. Lett..

[9]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[10]  Jeremy F. Shapiro,et al.  Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm , 1968, Oper. Res..

[11]  Egon Balas,et al.  Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants , 2009, Math. Program. Comput..

[12]  Egon Balas,et al.  Optimizing over the split closure , 2008, Math. Program..

[13]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[14]  Matteo Fischetti,et al.  Mixed-Integer Cuts from Cyclic Groups , 2005, IPCO.

[15]  Jeremy F. Shapiro,et al.  Computational experience with a group theoretic integer programming algorithm , 1973, Math. Program..

[16]  Gérard Cornuéjols,et al.  On the facets of mixed integer programs with two integer variables and two constraints , 2008, Math. Program..

[17]  François Margot,et al.  Testing cut generators for mixed-integer linear programming , 2009, Math. Program. Comput..

[18]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra, II , 1972, Math. Program..

[19]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[20]  Ellis L. Johnson,et al.  Cyclic group and knapsack facets , 2003, Math. Program..

[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]  Gerhard J. Woeginger,et al.  Operations Research Letters , 2011 .

[24]  Czech Republickrajicek.  Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic , 2007 .

[25]  Stephen A. Cook,et al.  An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..

[26]  Jan Kra,et al.  Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .

[27]  R E Gomory,et al.  ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[29]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[30]  Matteo Fischetti,et al.  Optimizing over the first Chvátal closure , 2005, Math. Program..

[31]  Arthur M. Geoffrion.  A guided tour of recent practical advances in integer linear programming , 1974, SMAP.

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

[33]  Sanjeeb Dash,et al.  An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs , 2002, IPCO.

[34]  William J. Cook,et al.  Numerically Safe Gomory Mixed-Integer Cuts , 2009, INFORMS J. Comput..

[35]  Jan Karel Lenstra,et al.  History of mathematical programming : a collection of personal reminiscences , 1991 .

[36]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[37]  Manfred Kudlek,et al.  On the Complexity of Propositional Calculus Formulae , 2001, Sci. Ann. Cuza Univ..

[38]  Jean-Philippe P. Richard,et al.  New inequalities for finite and infinite group problems from approximate lifting , 2008 .

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

[40]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[41]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, STOC '95.

[42]  Gérard Cornuéjols,et al.  K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau , 2003, INFORMS J. Comput..

[43]  Santanu S. Dey.  Two families of facets for the two-dimensional mixed integer in?nite group problem , 2006 .

[44]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[45]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[46]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra , 1972, Math. Program..

[47]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[48]  Yahya Fathi,et al.  Generalized mixed integer rounding inequalities: facets for infinite group polyhedra , 2009, Math. Program..

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

[50]  Jean-Philippe P. Richard,et al.  Facets of Two-Dimensional Infinite Group Problems , 2008, Math. Oper. Res..

[51]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

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

[53]  Sanjeeb Dash,et al.  Valid inequalities based on the interpolation procedure , 2006, Math. Program..

[54]  Sanjeeb Dash,et al.  On the complexity of cutting-plane proofs using split cuts , 2010, Oper. Res. Lett..

[55]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[56]  Friedrich Eisenbrand,et al.  The stable set polytope of quasi-line graphs , 2010, Comb..

[57]  Jean-Philippe P. Richard,et al.  Relations between facets of low- and high-dimensional group problems , 2010, Math. Program..

[58]  Ellis L. Johnson,et al.  Corner Polyhedra and their connection with cutting planes , 2003, Math. Program..

[59]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[60]  Sanjeeb Dash,et al.  On a generalization of the master cyclic group polyhedron , 2010, Math. Program..

[61]  Matteo Fischetti,et al.  Projected Chvátal–Gomory cuts for mixed integer linear programs , 2008, Math. Program..

[62]  A. Razborov.  Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic , 1995 .

[63]  Sanjeeb Dash,et al.  Valid inequalities based on simple mixed-integer sets , 2004, Math. Program..

[64]  Matteo Fischetti,et al.  How tight is the corner relaxation? , 2008, Discret. Optim..

[65]  Gérard Cornuéjols,et al.  Revival of the Gomory cuts in the 1990’s , 2007, Ann. Oper. Res..

[66]  Michele Conforti,et al.  Compact Formulations as a Union of Polyhedra , 2005 .

[67]  Andrea Lodi,et al.  MIR closures of polyhedral sets , 2009, Math. Program..

[68]  Juan Pablo Vielma.  A constructive characterization of the split closure of a mixed integer linear program , 2007, Oper. Res. Lett..

[69]  Alberto Caprara,et al.  On the separation of split cuts and related inequalities , 2003, Math. Program..

[70]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[71]  Miguel Fragoso Constantino,et al.  Description of 2-integer continuous knapsack polyhedra , 2006, Discret. Optim..

[72]  Adam N. Letchford,et al.  Binary clutter inequalities for integer programs , 2003, Math. Program..

[73]  Sanjeeb Dash,et al.  On the strength of Gomory mixed-integer cuts as group cuts , 2008, Math. Program..

[74]  Laurence A. Wolsey,et al.  Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.

[75]  Alper Atamtürk,et al.  On the facets of the mixed–integer knapsack polyhedron , 2003, Math. Program..

[76]  G. Nemhauser,et al.  Integer Programming , 2020 .

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

[78]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[79]  Osgood Condition,et al.  On a Generalization of the , 2000 .