The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5.

Sophia Heimann, Hung P. Hoang, Stefan Hougardy

Browse the full ICALP paper archive.