TSP Heuristics: Domination Analysis and Complexity

• 1 February 2003
• journal article
• research article
• Published by Springer Nature in Algorithmica
• Vol. 35  (2) , 111-127
• https://doi.org/10.1007/s00453-002-0986-1

Abstract

Keywords

• DOMINATION ANALYSIS, APPROXIMATION ALGORITHMS, TRAVELING SALESMAN PROBLEM, COMPUTATIONAL COMPLEXITY.