Paperlane

no. 15 · Monday 16 November 2026

TSP instances that require exponentially many subtour elimination constraints

Eleonora Vercesi and Austin Buchanan

math.CO · via cs.DM

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.

fields
Combinatorics
pdf ↗ page arXiv:2611.17386 ↗