3-opt, 4-opt, and the 2.5-opt variant of the traveling salesman problem each have instances requiring exponentially many improving local-search iterations under every pivot rule.
New results on the oldk-opt algo- rithm for the traveling salesman problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
3-opt, 4-opt, and the 2.5-opt variant of the traveling salesman problem each have instances requiring exponentially many improving local-search iterations under every pivot rule.