The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation

The path, the wheelbarrow, and the bicycle inequalities have been shown by Cornuejols, Fonlupt, and Naddef to be facet-defining for the graphical relaxation of STSP(n), the polytope of the symmetric traveling salesman problem on an n-node complete graph. We show that these inequalities, and some generalizations of them, define facets also for STSP(n). In conclusion, we characterize a large family of facet-defining inequalities for STSP(n) that include, as special cases, most of the inequalities currently known to have this property as the comb, the clique tree, and the chain inequalities. Most of the results given here come from a strong relationship of STSP(n) with its graphical relaxation that we have pointed out in another paper, where the basic proof techniques are also described.

[1]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

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

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

[4]  William J. Cook,et al.  Combinatorial optimization , 1997 .

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

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

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

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

[9]  Egon Balas,et al.  On the monotonization of polyhedra , 1997, Math. Program..

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

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

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

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

[14]  Yves Pochet,et al.  The Symmetric Traveling Salesman Polytope Revisited , 2001, Math. Oper. Res..

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

[16]  S. S. Sengupta,et al.  The traveling salesman problem , 1961 .

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

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

[19]  Martin Grötschel,et al.  On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets , 1980, Math. Oper. Res..

[20]  Vasek Chvátal,et al.  Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..

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

[22]  M. Padberg,et al.  On the symmetric travelling salesman problem II , 1979 .

[23]  Gerhard Reinelt,et al.  Not Every GTSP Facet Induces an STSP Facet , 2005, IPCO.

[24]  Denis Naddef,et al.  The domino inequalities: facets for the symmetric traveling salesman polytope , 2003, Math. Program..

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