An Efficient Approximation of the Traveling Salesman Polytope Using Lifting Methods

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…