On the graphical relaxation of the symmetric traveling salesman polytope

The Graphical Traveling Salesman Polyhedron (GTSP) has been proposed by Naddef and Rinaldi to be viewed as a relaxation of the Symmetric Traveling Salesman Polytope (STSP). It has also been employed by Applegate, Bixby, Chvátal, and Cook for solving the latter to optimality by the branch-and-cut method. There is a close natural connection between the two polyhedra. Until now, it was not known whether there are facets in TT-form of the GTSP polyhedron which are not facets of the STSP polytope as well. In this paper we give an affirmative answer to this question for n ≥ 9. We provide a general method for proving the existence of such facets, at the core of which lies the construction of a continuous curve on a polyhedron. This curve starts in a vertex, walks along edges, and ends in a vertex not adjacent to the starting vertex. Thus there must have been a third vertex on the way.

[1]  Michel X. Goemans,et al.  Worst-case comparison of valid inequalities for the TSP , 1995, Math. Program..

[2]  Robert Carr.  Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time , 1996, IPCO.

[3]  Michel X. Goemans,et al.  Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[4]  Michael Jünger,et al.  A complete description of the traveling salesman polytope on 8 nodes , 1991, Oper. Res. Lett..

[5]  Michael Jünger,et al.  Computational Combinatorial Optimization , 2001, Lecture Notes in Computer Science.

[6]  Gerhard Reinelt,et al.  Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes , 2001, Int. J. Comput. Geom. Appl..

[7]  William J. Cook,et al.  Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..

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

[9]  Dirk Oliver Theis.  Polyhedra and algorithms for the General Routing Problem , 2005 .

[10]  Jean Fonlupt,et al.  The traveling salesman problem in graphs with some excluded minors , 1992, Math. Program..

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

[12]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

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

[14]  Robert D. Carr.  Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation , 2004, Math. Oper. Res..

[15]  P. Macdonald.  Combinatorial Programming: Methods and Applications , 1976 .

[16]  B. Müller,et al.  Solution of the Traveling-Salesman Problem , 1995 .

[17]  M. Padberg,et al.  Linear Optimization and Extensions: Problems and Solutions , 2001 .

[18]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

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

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

[21]  Maurice Queyranne,et al.  Hamiltonian path and symmetric travelling salesman polytopes , 1993, Math. Program..

[22]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[23]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

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

[25]  William H. Cunningham,et al.  Small Travelling Salesman Polytopes , 1991, Math. Oper. Res..

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