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

Thumbnail Image
Download
Name

MIT-LCS-TR-479.pdf

Size

1.83 MB

Format

Adobe PDF

Checksum (MD5)

b8ee7dcf46773a2cde3da3fe9c216c01

Author(s)
Williamson, D.P.
Date Issued
June 1990
Series/Report no.
MIT-LCS-TR-479
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.