Comb inequalities for typical Euclidean TSP instances

12/01/2020 ∙ by Wesley Pegden, et al. ∙ 0

We prove that even in average case, the Euclidean Traveling Salesman Problem exhibits an integrality gap of (1+ϵ) for ϵ>0 when the Held-Karp Linear Programming relaxation is augmented by all comb inequalities of bounded size. This implies that large classes of branch-and-cut algorithms take exponential time for the Euclidean TSP, even on random inputs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.