David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Traveling Salesman Problem
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem
Prize-Collecting TSP with a Budget Constraint
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
On the Integrality Gap of the Subtour LP for the 1,2-TSP
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture
»
Cite
×