All Questions
2 questions
2
votes
1
answer
133
views
Constructing optimal Hamilton cycles from optimal Hamilton paths
Question:
can the shortest Hamilton cycle in a complete symmetric graph with weighted edges be constructed from the shortest Hamilton path in the same graph by connecting its ends and then exchanging ...
- 13.2k
-1
votes
1
answer
243
views
Helsgaun's $k$-Opt moves
In his 2009 paper General k-opt submoves for the Lin–Kernighan TSP
heuristic, Helsgaun defines the local tour improvements on which the LKH heuristics are based as:
with a cycle defined here:
which ...
- 13.2k