A note on the approximation of the asymmetric traveling salesman problem.
type: Item
instance of: scholarly article
title: A note on the approximation of the asymmetric traveling salesman problem.
zbMATH Open document ID: 1053.90114
DOI: 10.1016/S0377-2217(02)00794-4
author: Giovanni Righini
author: Marco Trubian
published in: European Journal of Operational Research
publication date: 2004-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2021188
zbMATH Keywords: Asymmetric traveling salesman problem
zbMATH Keywords: Worst-case approximation bounds
MaRDI profile type: Publication
cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
cites work: Q4198056
cites work: Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit
cites work: Identification of non-optimal arcs for the traveling salesman problem
cites work: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
full work available at URL: s0377-2217(02)00794-4
OpenAlex ID: W2095430141
description: scientific article; zbMATH DE number 2021188