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

Simple item page
dc.creatorStattenberger, Guenther
dc.creatorDankesreiter, Markus
dc.creatorBaumgartner, Florian
dc.creatorSchneider, Johannes J.
dc.date2006-08-27
dc.date.accessioned2026-07-07T07:25:55Z
dc.date.available2026-07-07T07:25:55Z
dc.descriptionWhen 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.
dc.description13 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/physics/0608269
dc.identifierhttp://arxiv.org/abs/physics/0608269
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116896
dc.subjectComputational Physics
dc.subjectData Analysis, Statistics and Probability
dc.titleOn the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts
dc.typetext

Files

Collections

arXiv