David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Traveling Salesman Problem
A faster, better approximation algorithm for the minimum latency problem.
A note on the prize-collecting traveling salesman problem.
Analysis of the Held-Karp lower bound for the asymmetric TSP.
Analyzing the Held-Karp TSP bound: A monotonicity property with application.
Analysis of the Held-Karp heuristic for the traveling salesman problem.
«
Cite
×