On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts

Guenther Stattenberger, Markus Dankesreiter, Florian Baumgartner +1

When trying to find approximate solutions for the Traveling Salesman Problem with heuristic optimization algorithms, small moves called Lin-$k$-Opts are often used. In our paper, w…