1 citations · 1 across the 6 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
Samuel C. Gutekunst
We study the edge-length polytope, motivated both by algorithmic research on the Circulant Traveling Salesman Problem (Circulant TSP) and number-theoretic research related to the B…
cs.DM2019
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP
Samuel C. Gutekunst, David P. Williamson
De Klerk, Pasechnik, and Sotirov give a semidefinite programming constraint for the Traveling Salesman Problem (TSP) based on the matrix-tree Theorem. This constraint says that the…