David P. Williamson
Traveling Salesman Problem
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture
On the integrality gap of the Subtour LP for the 1,2-TSP
A proof of the Boyd-Carr conjecture
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.