The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. - Sophia Heimann; Hung P. Hoang 001; Stefan Hougardy (ICALP, 2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem. - Sophia Heimann; Hung P. Hoang 001; Stefan Hougardy (CoRR, 2025)