Approximation algorithms for traveling salesman problems

DOI10.1017/9781009445436MaRDI QIDQ6593134zbMATH OpenFDO

Authors Vera Traub, Jens Vygen

Publication date 26 August 2024

Full work available at URL https://doi.org/10.1017/9781009445436

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial optimization (90C27)

Recommendations

• The traveling salesman problem and its variations
• The traveling salesman problem. A computational study.
• The traveling salesman problem: An overview of exact and approximate algorithms
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• An approximation algorithm for the maximum traveling salesman problem

Cited in

(3)

• The Traveling Salesman Problem
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• Implementation and numerical evaluation of Traub and Vygen algorithm for the subtour cover problem

This page was built for publication: Approximation algorithms for traveling salesman problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593134)