The malleability of TSP 2Opt

DOI10.1007/3-540-60618-1_73MaRDI QIDQ6122219

Sophie Fischer, Leen Torenvliet

Publication date: 28 February 2024

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

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• How easy is local search?
• Simple Local Search Problems that are Hard to Solve
• On Finding and Verifying Locally Optimal Solutions
• Unnamed Item
• Unnamed Item

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