All-Different Polytopes

We develop a parsimonious integer-programming model for all-different constraints.

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

[2]  Harvey M. Salkin,et al.  Foundations of integer programming , 1989 .

[3]  G. Meredith.  Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs , 1973 .

[4]  Sanjay Mehrotra,et al.  On the Value of Binary Expansions for General Mixed-Integer Linear Programs , 2002, Oper. Res..

[5]  Robert G. Jeroslow,et al.  Cutting-Plane Theory: Disjunctive Methods , 1977 .

[6]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[7]  John N. Hooker,et al.  Logic-Based Methods for Optimization , 1994, PPCP.

[8]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[9]  Jon Lee,et al.  A comparison of two edge-coloring formulations , 1993, Oper. Res. Lett..

[10]  Martin Grötschel,et al.  Weakly bipartite graphs and the Max-cut problem , 1981, Oper. Res. Lett..

[11]  Robert G. Jeroslow,et al.  An Introduction to the Theory of Cutting-Planes , 1979 .

[12]  Charles Eugene Blair.  Two Rules for Deducing Valid Inequalities for 0-1 Problems , 1976 .

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

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

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

[16]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[17]  E. Balas.  DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .

[18]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[20]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .