Analysis of the Held-Karp Heuristic for the Traveling Salesman Problem
| dc.contributor.author | Williamson, D.P. | en_US |
| dc.date.accessioned | 2023-03-29T15:16:52Z | |
| dc.date.available | 2023-03-29T15:16:52Z | |
| dc.date.issued | 1990-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149691 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-479 | |
| dc.title | Analysis of the Held-Karp Heuristic for the Traveling Salesman Problem | en_US |
| dc.identifier.oclc | 22135051 |
