A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
type: Item
instance of: scholarly article
title: A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
zbMATH Open document ID: 0956.90035
DOI: 10.1016/S0167-6377(98)00046-7
author: Shoshana Anily
author: Julien Bramel
author: Alain Hertz
published in: Operations Research Letters
publication date: 1999-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1347065
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: suboptimal algorithms
zbMATH Keywords: transportation
zbMATH Keywords: vehicle routing
zbMATH Keywords: ordered cluster traveling salesman problem
MaRDI profile type: Publication
cites work: Restricted delivery problems on a network
cites work: Tight bounds for christofides' traveling salesman heuristic
cites work: An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
cites work: Q4247262
cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles
cites work: Procedures for travelling salesman problems with additional constraints
full work available at URL: s0167-6377(98)00046-7
OpenAlex ID: W2162344698
description: scientific article; zbMATH DE number 1347065