The symmetric quadratic traveling salesman problem

In the quadratic traveling salesman problem a cost is associated with any three nodes traversed in succession. This structure arises, e.g., if the succession of two edges represents energetic conformations, a change of direction or a possible change of transportation means. In the symmetric case, costs do not depend on the direction of traversal. We study the polyhedral structure of a linearized integer programming formulation of the symmetric quadratic traveling salesman problem. Our constructive approach for establishing the dimension of the underlying polyhedron is rather involved but offers a generic path towards proving facetness of several classes of valid inequalities. We establish relations to facets of the Boolean quadric polytope, exhibit new classes of polynomial time separable facet defining inequalities that exclude conflicting configurations of edges, and provide a generic strengthening approach for lifting valid inequalities of the usual traveling salesman problem to stronger valid inequalities for the symmetric quadratic traveling salesman problem. Applying this strengthening to subtour elimination constraints gives rise to facet defining inequalities, but finding a maximally violated inequality among these is NP-complete. For the simplest comb inequality with three teeth the strengthening is no longer sufficient to obtain a facet. Preliminary computational results indicate that the new cutting planes may help to considerably improve the quality of the root relaxation in some important applications.

[1]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[2]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[3]  Alok Aggarwal,et al.  The angular-metric traveling salesman problem , 1997, SODA '97.

[4]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

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

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  Jérôme Monnot,et al.  The minimum reload s-t path, trail and walk problems , 2010, Discret. Appl. Math..

[8]  Brett Stevens,et al.  Hamiltonian decompositions of complete k-uniform hypergraphs , 2010, Discret. Math..

[9]  Gerold Jäger,et al.  Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order , 2008, COCOA.

[10]  Alain Billionnet,et al.  Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem , 2007, Math. Program..

[11]  J. Gallier.  Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.

[12]  Panos M. Pardalos,et al.  Quadratic Assignment and Related Problems , 1994 .

[13]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[14]  Rainer E. Burkard,et al.  On the Biquadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[15]  Martin Grötschel,et al.  Lineare Charakterisierungen von Travelling Salesman Problemen , 1977, Math. Methods Oper. Res..

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

[17]  Hans-Christoph Wirth,et al.  On Minimum Diameter Spanning Trees under Reload Costs , 1999, WG.

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

[19]  Francesco Maffioli,et al.  On minimum reload cost paths, tours, and flows , 2011, Networks.

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

[21]  Gerold Jäger,et al.  Complexity and Algorithms for the Traveling Salesman Problem and the Assignment Problem of Second Order ∗ , 2009 .

[22]  Francesco Maffioli,et al.  On Minimum Reload Cost Cycle Cover , 2014, Discret. Appl. Math..

[23]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[24]  Ulrich Faigle,et al.  A combinatorial algorithm for weighted stable sets in bipartite graphs , 2006, Discret. Appl. Math..

[25]  Etienne de Klerk,et al.  On Semidefinite Programming Relaxations of the Traveling Salesman Problem , 2007, SIAM J. Optim..

[26]  Eugene L. Lawler,et al.  A Guided Tour of Combinatorial Optimization , 1985 .

[27]  Alain Billionnet,et al.  Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method , 2009, Discret. Appl. Math..

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

[29]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[30]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[31]  Terence P. Speed,et al.  Finding short DNA motifs using permuted markov models , 2004, RECOMB.