Keld Helsgaun

According to our database, Keld Helsgaun authored at least 10 papers between 1984 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Local elimination in the traveling salesman problem.

William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder

Math. Program. Comput., December, 2024

Constrained Local Search for Last-Mile Routing.

William J. Cook, Stephan Held, Keld Helsgaun

Transp. Sci., 2024

2019

POPMUSIC for the travelling salesman problem.

Éric D. Taillard, Keld Helsgaun

Eur. J. Oper. Res., 2019

2018

Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic.

Renato Tinós, Keld Helsgaun, L. Darrell Whitley

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2015

Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun Algorithm.

Keld Helsgaun

Math. Program. Comput., 2015

2009

Certification of an optimal TSP tour through 85, 900 cities.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun

Oper. Res. Lett., 2009

General <i>k</i>-opt submoves for the Lin-Kernighan TSP heuristic.

Keld Helsgaun

Math. Program. Comput., 2009

2000

An effective implementation of the Lin-Kernighan traveling salesman heuristic.

Keld Helsgaun

Eur. J. Oper. Res., 2000

1995

CBack: A Simple Tool for Backtrack Programming in C.

Keld Helsgaun

Softw. Pract. Exp., 1995

1984

Backtrack Programming with SIMULA.

Keld Helsgaun

Comput. J., 1984