Analysis of the Held-Karp Heuristic for the Traveling Salesman Problem
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.
Main Author: | Williamson, D.P. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149691 |
Similar Items
-
On the spacefilling curve heuristic for the Eculidean traveling salesman problem
by: Bertsimas, Dimitris., et al.
Published: (2009) -
New heuristic function in ant colony system for the travelling salesman problem
by: Alobaedy, Mustafa Muwafak, et al.
Published: (2012) -
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
by: Lim, Yai-Fung, et al.
Published: (2016) -
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
by: Lim, Yai Fung, et al.
Published: (2011) -
An algorithm for the traveling salesman problem,
by: Little, John D. C.
Published: (2009)