New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem

We describe new computer-based search strategies for extreme functions for the Gomory–Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles several open questions.

[1]  Matthias Köppe,et al.  Light on the Infinite Group Relaxation , 2014, ArXiv.

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

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

[4]  Yanjun Li,et al.  Valid inequalities for MIPs and group polyhedra from approximate liftings , 2009, Math. Program..

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

[6]  Matthias Köppe,et al.  Facets, weak facets, and extreme functions of the Gomory–Johnson infinite group problem , 2016, Mathematical Programming.

[7]  Komei Fukuda,et al.  Double Description Method Revisited , 1995, Combinatorics and Computer Science.

[8]  Roberto Bagnara,et al.  The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems , 2006, Sci. Comput. Program..

[9]  Matthias Köppe,et al.  An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem , 2014, Oper. Res. Lett..

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

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

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

[13]  Matthias Köppe,et al.  Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case , 2012, IPCO.

[14]  Gérard Cornuéjols,et al.  A counterexample to a conjecture of Gomory and Johnson , 2010, Mathematical Programming.

[15]  Yanjun Li,et al.  On the extreme inequalities of infinite group problems , 2009, Math. Program..

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

[17]  Jean-Philippe P. Richard,et al.  The Group-Theoretic Approach in Mixed Integer Programming , 2010, 50 Years of Integer Programming.

[18]  Matthias Köppe,et al.  Software for Cut-Generating Functions in the Gomory-Johnson Model and Beyond , 2016, ICMS.

[19]  D. Avis.  A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm , 2000 .

[20]  Gerhard Reinelt,et al.  PANDA: a software for polyhedral transformations , 2015, EURO J. Comput. Optim..

[21]  Ellis L. Johnson,et al.  Cyclic group blocking polyhedra , 2013, Math. Program..

[22]  Sangho Shim,et al.  Large scale group network optimization , 2009 .

[23]  Matthias Köppe,et al.  Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms , 2016, 4OR.

[24]  Matthias Köppe,et al.  Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case , 2012, Math. Oper. Res..

[25]  David Avis,et al.  Computational experience with the reverse search vertex enumeration algorithm , 1998 .

[26]  Marco Di Summa,et al.  Extreme functions with an arbitrary number of slopes , 2016, IPCO.

[27]  Bogdan Ichim,et al.  The power of pyramid decomposition in Normaliz , 2012, J. Symb. Comput..

[28]  Matthias Köppe,et al.  Light on the infinite group relaxation I: foundations and taxonomy , 2014, 4OR.

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

[30]  Kenneth Chen.  Topics in group methods for integer programming , 2011 .

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