A note on the approximation of the asymmetric traveling salesman problem.

DOI10.1016/S0377-2217(02)00794-4zbMath1053.90114OpenAlexW2095430141MaRDI QIDQ1417511

Giovanni Righini, Marco Trubian

Publication date: 5 January 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00794-4

zbMATH Keywords

Asymmetric traveling salesman problemWorst-case approximation bounds

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
• Identification of non-optimal arcs for the traveling salesman problem
• Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

This page was built for publication: A note on the approximation of the asymmetric traveling salesman problem.