An Efficient Approximation of the Traveling Salesman Polytope Using Lifting Methods
Ellen Veomett
Abstract
For the Traveling Salesman Polytope on n cities Tn, we construct its approximation Qk, k=1, 2, . . ., n(1/3) using a projection of a polytope whose number of facets is polynomial in n (of degree linear in k). We show that Tn is contained in Qk for each k, and that the scaling of Qk by k/n+O(1/n) is contained in Tn for each k. We show that certain facets of Tn lie on the boundary of Qk.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.