Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Analyzing the performance of TSP solver methods

From MaRDI portal
Publication:2093970
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2093970&oldid=14582027"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 21:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki