Analysis of the Held-Karp Heuristic for the Traveling Salesman Problem

Author(s)
Williamson, D.P.
Thumbnail
DownloadMIT-LCS-TR-479.pdf (1.832Mb)
Metadata
Show full item record
Abstract
The Held-Karp heuristic for the Traveling Salesman Problem (TSP) has in practice provided near-optimal lower bounds on the cost of solutions to the TSP. We analyze the structure of Held-Karp solutions in order to shed light on their quality.
Date issued
1990-06
URI
https://hdl.handle.net/1721.1/149691
Series/Report no.
MIT-LCS-TR-479
Collections