Abstract
The polytope associated with the symmetric travelling salesman problem has been intensively studied recently (cf. [7, 10, 11]). In this note we demonstrate how the knowledge of the facets of this polytope can be utilized to solve large-scale travelling salesman problems. In particular, we report how the shortest roundtrip through 120 German cities was found using a commercial linear programming code and adding facetial cutting planes in an interactive way.
Supported by Sonderforschungsbereich 21 (DFG), Institut für ökonometrie und Operations Research, Universität Bonn.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.E. Burkard, “Travelling salesman and assignment problems: A Survey”, Annals of Discrete Mathematics 4 (1979) 193–215.
V. Chvátal, “Edmonds polytopes and weakly Hamiltonian graphs”, Mathematical Programming 5 (1973) 29–40.
G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large-scale travelling-salesman problem”, Operations Research 2 (1954) 393–410.
Deutscher General Atlas (Mairs Geographischer Verlag, Stuttgart, 1967/68).
J. Edmonds, “Maximum matching and a polyhedron with 0,1 vertices”, Journal of Research of the National Bureau of Standards 69B (1965) 125–130.
J. Edmonds, “Matroids and the Greedy algorithm”, Mathematical Programming 1 (1971) 127–136.
M. Grötschel, Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme (Anton Hain Verlag, Meisenheim/Glan., 1977).
M. Grötschel and M.W. Padberg, “Partial linear characterizations of the asymmetric travelling salesman polytope”, Mathematical Programming 8 (1975) 378–381.
M. Grötschel and M.W. Padberg, “Lineare Charakterisierungen von Travelling Salesman Problemen”, Zeitschrift für Operations Research 21A (1977) 33–64.
M. Grötschel and M.W. Padberg, “On the symmetric travelling salesman problem I: Inequalities”, Mathematical Programming 16 (1979) 265–280.
M. Grötschel and M.W. Padberg, “On the symmetric travelling salesman problem II: Lifting theorems and facets”, Mathematical Programming 16 (1979) 281–302.
S. Hong, “A linear programming approach for the travelling salesman problem”, Thesis (Johns Hopkins University, Baltimore, 1972).
J.F. Maurras, “Some results on the convex hull of the Hamiltonian cycles of symmetric complete graphs”, in: B. Roy, ed., Combinatorial programming: methods and applications (Reidel, Dordrecht, 1975).
P. Miliotis, “Integer programming approaches to the travelling salesman problem”, Mathematical Programming 10 (1976) 367–378.
M.W. Padberg and S. Hong, “On the symmetric travelling salesman problem: A computational study”, Mathematical Programming Studies 12 (1980) 61–77.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 The Mathematical Programming Society
About this chapter
Cite this chapter
Grötschel, M. (1980). On the symmetric travelling salesman problem: Solution of a 120-city problem. In: Padberg, M.W. (eds) Combinatorial Optimization. Mathematical Programming Studies, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120887
Download citation
DOI: https://doi.org/10.1007/BFb0120887
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00801-6
Online ISBN: 978-3-642-00802-3
eBook Packages: Springer Book Archive