All Questions

G. A. Croes is the author of the first description of the 2-opt moves heuristic for improving non-optimal traveling salesman tours: Croes, G. A. “A Method for Solving Traveling-Salesman Problems.” ...

$\mathrm{k}$-$\operatorname{opt}$ moves are an idea to improve non-optimal Hamilton cycles in weighted symmetric graphs by exchanging $\mathrm{k}$ tour-edges with $\mathrm{k}$ edges that do not belong ...

By "autonomous" TSP heuristic I mean algorithms whose reported edge-set for a short Hamilton cycle is invariant under the addition of vertex weights; the terminology is borrowed from ...