Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Achterberg T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1–41 (2009)
Aggarwal A., Coppersmith D., Khanna S., Motwani R., Schieber B.: The angular-metric traveling salesman problem. SIAM J. Comput. 29, 697–711 (1999)
Amaldi E., Galbiati G., Maffioli F.: On minimum reload cost paths, tours, and flows. Networks 57, 254–260 (2011)
Applegate D.L., Bixby R.E., Chvatal V., Cook W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)
Billionnet A., Elloumi S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0–1 problem. Math. Program. 109, 55–68 (2007)
Billionnet A., Elloumi S., Plateau M.C.: Improving the performance of standard solvers for quadratic 0–1 programs by a tight convex reformulation: the QCR method. Discrete Appl. Math. 157, 1185–1197 (2009)
Burkard, R., Çela, E., Klinz, B.: On the biquadratic assignment problem. In: Pardalos P., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16. pp. 117–146 (1994)
Chvátal V.: Edmonds polytopes and weakly hamiltonian graphs. Math. Program. 5, 29–40 (1973)
Dantzig G., Fulkerson R., Johnson S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393–410 (1954)
De Klerk E., Pasechnik D.V., Sotirov R.: On semidefinite programming relaxations of the traveling salesman problem. SIAM J. Optim. 19(4), 1559–1573 (2008)
Faigle U., Frahling G.: A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Appl. Math. 154(9), 1380–1391 (2006)
Fischer, F., Jäger, G., Lau, A., Molitor, P.: Complexity and Algorithms for the Traveling Salesman Problem and the Assignment Problem of Second Order. Preprint 2009-16, Fakultät für Mathematik, Technische Universität Chemnitz, D-09107 Chemnitz, Germany (2009)
Galbiati G., Gualandi S., Maffioli F.: On minimum reload cost cycle cover. Electron. Notes Discrete Math. 36, 81–88 (2010)
Gourvès L., Lyra A., Martinhon C., Monnot J.: The minimum reload s-t path, trail and walk problems. Discrete Appl. Math. 158, 1404–1417 (2010)
Grötschel M., Padberg M.W.: Lineare Charakterisierungen von Travelling Salesman Problemen. Zeitschrift für Oper. Res. Ser. A 21(1), 33–64 (1977)
Grötschel M., Padberg M.W.: On the symmetric travelling salesman problem I: inequalities. Math. Program. 16, 265–280 (1979)
Grötschel M., Padberg M.W.: On the symmetric travelling salesman problem II: lifting theorems and facets. Math. Program. 16, 281–302 (1979)
Gutin G., Punnen A., Barvinok A., Gimadi E.K., Serdyukov A.I.: The Traveling Salesman Problem and Its Variations (Combinatorial Optimization). Springer, Berlin (2002)
Hong, S.: A Linear Programming Approach for the Traveling Salesman Problem. Ph.D. thesis, John Hopkins University, Baltimore, MD, USA (1972)
IBM ILOG CPLEX 12.2: Using the CPLEX callable library. Information available at http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/
Jäger G., Molitor P.: Algorithms and experimental study for the traveling salesman problem of second order. Lect. Notes Comput. Sci. 5165, 211–224 (2008)
Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B. (eds): The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)
Lovász L., Schrijver A.: Cones of matrices and set-functions and 0–1 optimization. SIAM J. Optim. 1(2), 166–190 (1991)
Mathematica 7. Information available at http://www.wolfram.com/mathematica/
Padberg M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139–172 (1989)
SCIP 2.1.1. Information available at http://scip.zib.de/
Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1–11 (1987). Originally published in Tekhnicheskaya Kibernetika, No. 1, 1987, pp. 128–139
Wirth H.C., Steffan J.: On minimum diameter spanning trees under reload costs. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1665, pp. 78–89. Springer, Berlin (1999)
Zhao X., Huang H., Speed T.P.: Finding short DNA motifs using permuted markov models. J. Comput. Biol. 12(6), 894–906 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fischer, A., Helmberg, C. The symmetric quadratic traveling salesman problem. Math. Program. 142, 205–254 (2013). https://doi.org/10.1007/s10107-012-0568-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-012-0568-1
Keywords
- Combinatorial optimization
- Quadratic 0–1 programming
- Angular-metric traveling salesman problem
- Reload cost model