Valid inequalities based on simple mixed-integer sets

In this paper we use facets of the convex hull of mixed-integer sets with two and three variables to derive valid inequalities for integer sets defined by a single equation. These inequalities also define facets of the master cyclic group polyhedron of Gomory. In particular, our inequalities generalize the 2slope facets of Araoz, Gomory, Johnson and Evans (2003). In addition, they dominate the strong fractional cuts of Letchford and Lodi (2002).

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

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

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

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

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

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

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

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

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

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

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

[12]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

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

[15]  Ellis L. Johnson,et al.  T-space and cutting planes , 2003, Math. Program..

[16]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[17]  Laurence A. Wolsey,et al.  Non-standard approaches to integer programming , 2002, Discret. Appl. Math..

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