arXiv · 2611.17386
TSP instances that require exponentially many subtour elimination constraints
Abstract
We construct pathological TSP instances that require exponentially many subtour elimination constraints (SECs) in the sense that, if a smaller collection of SECs is imposed, then the Dantzig-Fulkerson-Johnson model returns a disconnected solution costing less than an optimal tour. For asymmetric instances on $n$ vertices, we prove a growth rate of \(Ω(ϕ^n)\), where \(ϕ\approx 1.618\) is the golden ratio. A node-splitting reduction gives metric instances with \(Ω(ϕ^{n/2})\) growth. We also give instances in the plane under the Euclidean, Rectilinear, and Maximum metrics that require exponentially many SECs. Concorde struggles on them, with solve times growing exponentially despite tiny integrality gaps.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Eleonora Vercesi, Austin Buchanan. 2026-11-11. TSP instances that require exponentially many subtour elimination constraints. https://searcharxiv.com/abs/2611.17386
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.