A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
From MaRDI portal
Publication:1130068
DOI10.1016/0377-2217(94)00010-AzbMath0912.90279MaRDI QIDQ1130068
Marco Trubian, Giovanni Righini
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
Related Items
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem, Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems, A note on the approximation of the asymmetric traveling salesman problem., A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- Local Search for the Asymmetric Traveling Salesman Problem
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem