The malleability of TSP 2Opt

DOI10.1007/3-540-60618-1_73MaRDI QIDQ6122219zbMATH OpenFDO

Authors Sophie Fischer, Leen Torenvliet

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60618-1_73

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cites work

• How easy is local search?
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On Finding and Verifying Locally Optimal Solutions
• Simple Local Search Problems that are Hard to Solve

Cited in

(1)

• Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP

This page was built for publication: The malleability of TSP 2Opt

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122219)