Approximation algorithms for the traveling salesman problem

DOI10.1007/s001860200239zbMath1064.90572OpenAlexW2004153594MaRDI QIDQ1812290

Vangelis Th. Paschos, Sophie Toulouse, Jérôme Monnot

Publication date: 23 June 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860200239

zbMATH Keywords

traveling salesmanapproximation algorithmNP-complete problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (5)

Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem ⋮ A 3/4 differential approximation algorithm for traveling salesman problem ⋮ A survey on the structure of approximation classes ⋮ A better differential approximation ratio for symmetric TSP ⋮ Combining local search and elicitation for multi-objective combinatorial optimization

This page was built for publication: Approximation algorithms for the traveling salesman problem