Fat Computational Complexity and Heuristic Design for the TSP

DOI10.3724/SP.J.1001.2009.03418zbMath1212.68077OpenAlexW2332272473MaRDI QIDQ3054243

Qiang Li, Hong Yu, He Jiang, Yan Hu

Publication date: 5 November 2010

Published in: Journal of Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1001.2009.03418

zbMATH Keywords

traveling salesman problemNP-hardheuristic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Uses Software

• TSPLIB