On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances

DOI10.1007/s11590-014-0828-5zbMath1331.90067WikidataQ59585904 ScholiaQ59585904MaRDI QIDQ497453

Holger H. Hoos, Thomas Stützle

Publication date: 24 September 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0828-5

zbMATH Keywords

TSP; exact algorithms; empirical complexity

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

Uses Software

• TSPLIB
• LKH
• Concorde