W. Cook, S. Held, and K. Helsgaun,
Local Search with Learned Constraints for Last Mile Routing.
Technical Report, July 2021.

É. D. Taillard and K. Helsgaun,
POPMUSIC for the Travelling Salesman Problem.
European Journal of Operational Research, Volume 272, Issue 2, pp. 420-429, 2019.

K. Helsgaun,
Using POPMUSIC for Candidate Set Generation in the Lin-Kernighan-Helsgaun TSP Solver.
Technical Report, Computer Science, Roskilde University, 2018.

R. Tinós, K. Helsgaun, and D. Whitley,
Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic.
PPSN XV, Processings, Part I, pp. 95-107, 2018.

K. Helsgaun,
An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Problems.
Technical Report, Computer Science, Roskilde University, 2017.

K. Helsgaun,
Solving the Equality Generalized Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm.
Mathematical Programming Computation, Volume 7, Issue 3, pp 269-287, 2015.

K. Helsgaun,
Solving Arc Routing Problems Using the Lin-Kernighan-Helsgaun Algorithm.
Technical Report, Computer Science, Roskilde University, 2014.

K. Helsgaun,
Solving the Bottleneck Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm.
Technical Report, Computer Science, Roskilde University, 2014.

K. Helsgaun,
Solving the Equality Generalized Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm.
Technical Report, Computer Science, Roskilde University, 2013.

K. Helsgaun,
Solving the Clustered Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm.
Technical Report, Computer Science, Roskilde University, 2013.

K. Helsgaun,
General k-opt submoves for the Lin-Kernighan TSP heuristic.
Mathematical Programming Computation, 2009,
doi: 10.1007/s12532-009-0004-6.

D. L. Applegate, R. E. Bixby, V. Chvatal, W. Cook, D.G. Espinoza,
Marcos Goycoolea, and K. Helsgaun,
Certification of an optimal TSP tour through 85,900 cities.
Operations Research Letters, 37, pp. 11-15, 2009.

K. Helsgaun,
An Effective Implementation of K-opt Moves for the Lin-Kernighan TSP Heuristic,
DATALOGISKE SKRIFTER (Writings on Computer Science), 2006,
Roskilde University.

K. Helsgaun,
jDisco - a Java package for combined discrete and continuous simulation,
DATALOGISKE SKRIFTER (Writings on Computer Science), 2001,
Roskilde University.

K. Helsgaun,
Discrete Event Simulation in Java,
DATALOGISKE SKRIFTER (Writings on Computer Science), 2000,
Roskilde University.

K. Helsgaun,
A Portable C++ Library for Coroutine Sequencing,
DATALOGISKE SKRIFTER (Writings on Computer Science), 1999,
Roskilde University.

K. Helsgaun,
An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic,
DATALOGISKE SKRIFTER (Writings on Computer Science), No. 81, 1998,
Roskilde University.

K. Helsgaun,
CBack: A Simple Tool for Backtrack Programming in C,
Software - Practice & Experience, Vol. 25, No. 8, August 1995 (pp. 905-934).

K. Helsgaun,
Backtrack Programming with SIMULA,
The Computer Journal, Vol. 17, No. 2, 1984 (pp. 151-158).

K. Helsgaun,
DISCO - a SIMULA-based language for combined continuous and discrete simulation.
SIMULATION, Vol. 34, no. 7, July 1980 (pp. 1-12).