Strengthening Gomory Mixed-Integer Cuts: A Computational Study

Gomory mixed-integer cuts are an important ingredient in state-ofthe-art software for solving mixed-integer linear programs. In particular, much attention has been paid to the strengthening of these cuts. In this paper, we give an overview of existing approaches for improving the performance of Gomory mixed-integer cuts. More precisely, we consider k-cuts, combined Gomory mixed-integer cuts, reduce-and-split cuts, and lift-and-project cuts. We give a detailed description of the implementation of the separation routines for these cutting planes. Finally, we report on computational results with the different strengthening approaches on a large-scale test set and analyze their performance. We also investigate the characteristics of the generated cutting planes. The results show that, although Gomory mixed-integer cuts are very effective, strengthening these cuts can have a positive impact on the performance of a MIP solver in many cases.

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

[2]  Kent Andersen,et al.  Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts , 2005, Manag. Sci..

[3]  Egon Balas,et al.  Generating Cuts from Multiple-Term Disjunctions , 2001, IPCO.

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

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

[6]  Egon Balas,et al.  Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..

[7]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[8]  Robert E. Bixby,et al.  Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..

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

[10]  Uwe H. Suhl,et al.  MOPS -- Mathematical optimization system , 1994 .

[11]  H. Markowitz.  The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

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

[13]  Michael Perregaard.  Generating Disjunctive Cuts for Mixed Integer Programs , 2003 .

[14]  Milind Dawande,et al.  Combining and Strengthening Gomory Cuts , 1995, IPCO.

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

[16]  Egon Balas.  A modified lift-and-project procedure , 1997, Math. Program..

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

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

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

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

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

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

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

[24]  Egon Balas.  Disjunctive Programming , 2010, 50 Years of Integer Programming.

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

[26]  Egon Balas,et al.  New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing , 2007, IPCO.

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