Analyzing the performance of TSP solver methods

DOI10.1007/978-3-030-88817-6_8OpenAlexW4205899543MaRDI QIDQ2093970

László T. Kóczy, Péter Földesi, Boldizsár Tüű-Szabó

Publication date: 27 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88817-6_8

zbMATH Keywords

traveling salesman problemconcordeLin-KernighanDBMEA

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• LKH

Cites Work

• Unnamed Item
• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Analyzing the performance of TSP solver methods