TSP Cuts Which Do Not Conform to the Template Paradigm

The first computer implementation of the Dantzig-Fulkerson-Johnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory's type. The practice of looking for and using cuts that match prescribed templates in conjunction with Gomory cuts was continued in computer codes of Miliotis, Land, and Fleischmann. Grotschel, Padberg, and Hong advocated a different policy, where the template paradigm is the only source of cuts; furthermore, they argued for drawing the templates exclusively from the set of linear inequalities that induce facets of the TSP polytope. These policies were adopted in the work of Crowder and Padberg, in the work of Grotschel and Holland, and in the work of Padberg and Rinaldi; their computer codes produced the most impressive computational TSP successes of the nineteen eighties. Eventually, the template paradigm became the standard frame of reference for cutting planes in the TSP. The purpose of this paper is to describe a technique for finding cuts that disdains all understanding of the TSP polytope and bashes on regardless of all prescribed templates. Combining this technique with the traditional template approach was a crucial step in our solutions of a 13,509-city TSP instance and a 15,112-city TSP instance.

[1]  Giovanni Rinaldi,et al.  An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

[2]  Denis Naddef,et al.  Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation , 2002, Math. Program..

[3]  Gerhard Reinelt,et al.  A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[4]  Giovanni Rinaldi,et al.  The graphical relaxation: A new framework for the symmetric traveling salesman polytope , 1993, Math. Program..

[5]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[6]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[7]  Manfred W. Padberg.  Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..

[8]  J. Maurras.  Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete Graphs , 1975 .

[9]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[10]  Robert Carr,et al.  Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time , 1997, Math. Oper. Res..

[11]  E. Andrew Boyd,et al.  Generating Fenchel Cutting Planes for Knapsack Polyhedra , 1993, SIAM J. Optim..

[12]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[13]  Adam N. Letchford.  Separating a Superclass of Comb Inequalities in Planar Graphs , 2000, Math. Oper. Res..

[14]  E. Andrew Boyd,et al.  Fenchel Cutting Planes for Integer Programs , 1994, Oper. Res..

[15]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[16]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[17]  Giovanni Rinaldi,et al.  The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities , 1991, Math. Program..

[18]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[19]  L. A. Pchelintsev.  On a solution of the travelling salesman problem , 1966 .

[20]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[21]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[22]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[23]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[24]  Martin Grötschel,et al.  Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .

[25]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[26]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

[27]  William Cook.  Solving Traveling Salesman Problems , 2002, ESA.

[28]  William R. Pulleyblank,et al.  Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..

[29]  Éva Tardos,et al.  Separating Maximally Violated Comb Inequalities in Planar Graphs , 1999, Math. Oper. Res..

[30]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[31]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[32]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[33]  David Applegate,et al.  Finding Cuts in the TSP (A preliminary report) , 1995 .

[34]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[35]  G. Reinelt,et al.  Combinatorial optimization and small polytopes , 1996 .

[36]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[37]  Jean-Maurice Clochard,et al.  Using path inequalities in a branch and cut code for the symmetric traveling salesman problem , 1993, IPCO.

[38]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[39]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[40]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[41]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

[42]  Denis Naddef,et al.  Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities , 2002, Math. Program..

[43]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[44]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

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

[46]  Bernhard Fleischmann,et al.  A new class of cutting planes for the symmetric travelling salesman problem , 1988, Math. Program..

[47]  Laurence A. Wolsey,et al.  Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..

[48]  H. Minkowski,et al.  Geometrie der Zahlen , 1896 .

[49]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

[50]  B. Fleischmann.  A cutting plane procedure for the travelling salesman problem on road networks , 1985 .

[51]  Martin Grötschel,et al.  On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..