David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Samuel C. Gutekunst
Latest
GILP: An Interactive Tool for Visualizing the Simplex Algorithm
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP
The Two-Stripe Symmetric Circulant TSP is in P
Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
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
Cite
×