A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
type: Item
instance of: scholarly article
title: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
zbMATH Open document ID: 0912.90279
DOI: 10.1016/0377-2217(94)00010-A
author: Giovanni Righini
author: Marco Trubian
published in: European Journal of Operational Research
publication date: 1998-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1191370
zbMATH Keywords: heuristics
zbMATH Keywords: computational analysis
zbMATH Keywords: asymmetric travelling salesman
zbMATH Keywords: bound
MaRDI profile type: Publication
cites work: Q4744064
cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
cites work: Q4198056
cites work: Local Search for the Asymmetric Traveling Salesman Problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q5519710
cites work: Q3677509
cites work: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
full work available at URL: 0377-2217(94)00010-a
OpenAlex ID: W2039862207
description: scientific article; zbMATH DE number 1191370