Abstract
The graphical traveling salesman problem (GTSP) has been studied as a variant of the classical symmetric traveling salesman problem (STSP) suited particularly for sparse graphs. In addition, it can be viewed as a relaxation of the STSP and employed for solving the latter to optimality as originally proposed by Naddef and Rinaldi. There is a close natural connection between the two associated 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 and provide a general method for constructing such facets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alevras, D., Padberg, M.W.: Linear optimization and extensions: problems and solutions. Springer, Heidelberg (2001)
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: On the solution of the Traveling Salesman Problem. In: Doc. Math. J. DMV (Extra Volume ICM), pp. 645–656 (1998)
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization, pp. 261–303. Springer, Heidelberg (2001)
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Implementing the Dantzig-Fulkerson-Johnson algorithm for large Traveling Salesman Problems. Math. Program. Ser. B 97(1–2), 91–153 (2003)
Boyd, S.C., Cunningham, W.H.: Small Travelling Salesman Polytopes. Math. Oper. Res. 16(2), 259–271 (1991)
Carr, R.: Separating over classes of TSP inequalities defined by 0-node lifting in polynomial time. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) Proc. IPCO V, pp. 460–474 (1996)
Carr, R.: Separation algorithms for classes of STSP inequalities arising from a new STSP relaxation. Math. Oper. Res. 29(1), 80–91 (2004)
Christof, T., Jünger, M., Reinelt, G.: A complete description of the traveling salesman polytope on 8 nodes. OR Letters 10, 497–500 (1991)
Christof, T., Löbel, A.: PORTA – a polyhedron representation algorithm (1998), http://www.informatik.uni-heidelberg.de/groups/comopt/software/PORTA/
Christof, T., Reinelt, G.: SmaPo – library of Small Polytopes, http://www.informatik.uni-heidelberg.de/groups/comopt/software/SMAPO//tsp/tsp.html
Christof, T., Reinelt, G.: Decomposition and parallelization techniques for enumerating the facets of combinatorial polytopes. Int. J. Comput. Geom. Appl. 11, 423–437 (2001)
Cornuéjols, G., Fonlupt, J., Naddef, D.: The Traveling Salesman Problem on a Graph and some related Integer Polyhedra. Math. Program. 33, 1–27 (1985)
Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling salesman problem. Oper. Res. 2, 393–410 (1954)
Fleischmann, B.: A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21, 307–317 (1985)
Fonlupt, J., Naddef, D.: The Traveling Salesman Problem in graphs whith some excluded minors. Math. Program. 53(2), 147–172 (1992)
Goemans, M.X.: Worst-case comparison of valid inequalities for the TSP. Math. Program. 69(2), 335–349 (1995)
Naddef, D., Rinaldi, G.: The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program. 51, 359–400 (1991)
Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. Math. Program. 58, 53–88 (1993)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oswald, M., Reinelt, G., Theis, D.O. (2005). Not Every GTSP Facet Induces an STSP Facet. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_34
Download citation
DOI: https://doi.org/10.1007/11496915_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)