Abstract
A solution of the traveling salesman problem (TSP) with n nodes consists of n edges which form a shortest tour. In our approach we compute an upper bound u for the longest edge which could be in an optimal solution. This means that every edge longer than this bound cannot be in an optimal solution. The quantity u can be computed in polynomial time. We have applied our approach to different problems of the TSPLIB (library of sample instances for the TSP). Our bound does not necessarily improve the fastest TSP-algorithms. However, the reduction of the number of edges might be useful for certain instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Achatz, H., Kleinschmidt, P., & Paparrizos, K. (1991). A dual forest algorithm for the assignment problem. In P. Gritzmann, B. Sturmfels & V. Klee (Eds.), Applied geometry and discrete mathematics. The Victor Klee festschrift (pp. 1–10). Providence, R.I.: AMS (DIMACS’4).
Achatz, H. (1999). Sensitivity analysis of the bipartite weighted matching problem. In P. Kall (Ed.), Operations Research Proceedings 1998. Selected Papers of the International Conference on Operations Research, Zürich (pp. 135–141). Aug31–Sept 3, 1998. Berlin: Springer.
Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2007). The traveling salesman problem. A computational story. Princeton, NJ: Princeton University Press (Princeton series in applied mathematics).
Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21, 498–516.
Reinelt, G. (1991). TSPLIB—a traveling salesman problem library. ORSA Journal on Computing, 3, 376–384.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Achatz, H., Kleinschmidt, P. (2014). Computing an Upper Bound for the Longest Edge in an Optimal TSP-Solution. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-07001-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07000-1
Online ISBN: 978-3-319-07001-8
eBook Packages: Business and EconomicsBusiness and Management (R0)