Computational Experiments with Cross and Crooked Cross Cuts

In a recent paper, Dash, Dey and G¨ unl¨ uk (2010) showed that many families of inequalities for the two-row continuous group relaxation and variants of this relaxation are cross cuts or crooked cross cuts, both of which generalize split cuts. Li and Richard (2008) recently studied t-branch split cuts for mixedinteger programs for integers t 1. Split cuts are just 1-branch split cuts, and cross cuts are 2-branch split cuts. In this paper, we study whether cross and crooked cross cuts can be separated in an effective manner for practical MIPs, and can yield a non-trivial improvement over the bounds obtained by split cuts. We also study whether such cuts obtained from two simplex tableau rows at a time can strengthen the bounds obtained by GMI cuts based on single tableau rows. We give positive answers to both these questions for MIPLIB 3.0 problems.

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

[2]  Laurent Poirrier,et al.  An algorithm for the separation of two-row cuts , 2014, Math. Program..

[3]  Gérard Cornuéjols,et al.  On the relative strength of split, triangle and quadrilateral cuts , 2009, Math. Program..

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

[5]  Gerhard J. Woeginger,et al.  Operations Research Letters , 2011 .

[6]  Sanjeeb Dash,et al.  On the relative strength of different generalizations of split cuts , 2015, Discret. Optim..

[7]  Daniel G. Espinoza.  Computing with multi-row Gomory cuts , 2008, Oper. Res. Lett..

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

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

[10]  Sanjeeb Dash,et al.  A heuristic to generate rank-1 GMI cuts , 2010, Math. Program. Comput..

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

[12]  Gérard Cornuéjols,et al.  Minimal Valid Inequalities for Integer Constraints , 2009, Math. Oper. Res..

[13]  Matteo Fischetti,et al.  A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts , 2010, CPAIOR.

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

[15]  Gérard Cornuéjols,et al.  Minimal Inequalities for an Infinite Relaxation of Integer Programs , 2010, SIAM J. Discret. Math..

[16]  J. Henry,et al.  System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, Compiègne, France, July 5-9, 1993 , 1994, System Modelling and Optimization.

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

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

[19]  Laurence A. Wolsey,et al.  Constrained Infinite Group Relaxations of MIPs , 2010, SIAM J. Optim..

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

[21]  Laurence A. Wolsey,et al.  Two row mixed-integer cuts via lifting , 2010, Math. Program..

[22]  Matteo Fischetti,et al.  On the separation of disjunctive cuts , 2011, Math. Program..

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

[24]  Yanjun Li,et al.  Cook, Kannan and Schrijver's example revisited , 2008, Discret. Optim..

[25]  L. Wolsey,et al.  Cutting Planes form Two Rows of a Simplex Tableau , 2007 .

[26]  G. Cornuéjols,et al.  Corner Polyhedron and Intersection Cuts , 2011 .

[27]  Matteo Fischetti,et al.  A relax-and-cut framework for Gomory mixed-integer cuts , 2011, Math. Program. Comput..

[28]  Laurence A. Wolsey,et al.  Experiments with Two Row Tableau Cuts , 2010, IPCO.

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

[30]  R. Bixby.  An Updated Mixed Integer Programming Library MIPLIB , 1998 .

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

[32]  Sanjeeb Dash,et al.  Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra , 2012, Math. Program..

[33]  Sanjeeb Dash,et al.  On mixed-integer sets with two integer variables , 2011, Oper. Res. Lett..

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

[35]  Gérard Cornuéjols,et al.  A Geometric Perspective on Lifting , 2011, Oper. Res..

[36]  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..

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

[38]  Oktay Günlük,et al.  Strengthening lattice-free cuts using non-negativity , 2011, Discret. Optim..

[39]  Gérard Cornuéjols,et al.  On Lifting Integer Variables in Minimal Inequalities , 2010, IPCO.

[40]  Pierre Bonami.  On optimizing over lift-and-project closures , 2012, Math. Program. Comput..

[41]  Gérard Cornuéjols,et al.  Experiments with Two-Row Cuts from Degenerate Tableaux , 2011, INFORMS J. Comput..