arXiv · physics/0608269
On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts
Abstract
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, we provide exact formulas for the numbers of possible tours into which a randomly chosen tour can be changed with a Lin-$k$-Opt.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Guenther Stattenberger, Markus Dankesreiter, Florian Baumgartner, Johannes J. Schneider. 2006-08-27. On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts. https://arxiv.org/abs/physics/0608269
Cite the original work for its findings. Save a collection to share your selection of sources.