Worst-case analysis of two travelling salesman heuristics
type: Item
instance of: scholarly article
title: Worst-case analysis of two travelling salesman heuristics
zbMATH Open document ID: 0528.90083
DOI: 10.1016/0167-6377(84)90078-6
author: Hoon Liong Ong
author: J. B. Moore
published in: Operations Research Letters
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3839706
zbMATH Keywords: symmetric travelling salesman problem
zbMATH Keywords: heuristics
zbMATH Keywords: worst-case performance
zbMATH Keywords: comparison of algorithms
MaRDI profile type: Publication
full work available at URL: 0167-6377(84)90078-6
OpenAlex ID: W2018689801
cites work: Q4744064
cites work: Tight bounds for christofides' traveling salesman heuristic
cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
cites work: Q4191856
cites work: Q4198056
cites work: Q4142699
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: P-Complete Approximation Problems
description: scientific article; zbMATH DE number 3839706