Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Computing an Upper Bound for the Longest Edge in an Optimal TSP-Solution
verfasst von : Hans Achatz, Peter Kleinschmidt
Erschienen in: Operations Research Proceedings 2013
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.
