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…