Approximations for minimum and min-max vehicle routing problems
type: Item
instance of: scholarly article
title: Approximations for minimum and min-max vehicle routing problems
zbMATH Open document ID: 1112.68135
author: Esther M. Arkin
author: Refael Hassin
author: Asaf Levin
published in: Journal of Algorithms
publication date: 2006-10-05T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5060588
zbMATH Keywords: approximation algorithms
zbMATH Keywords: edge-routing
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: min-max problems
MaRDI profile type: MaRDI publication profile
full work available at URL: j.jalgor.2005.01.007
OpenAlex ID: W2071701840
DOI: 10.1016/J.JALGOR.2005.01.007
Recommended article: Improved approximation algorithms for min-max and minimum vehicle routing problems
Recommended article: Approximation results for min-max path cover problems in vehicle routing
Recommended article: Approximation algorithms for some vehicle routing problems
Recommended article: Approximation algorithms for a vehicle routing problem
Recommended article: Approximation algorithms for distance constrained vehicle routing problems
Recommended article: Approximation results for a min-max location-routing problem
Recommended article: Solution of a min-max vehicle routing problem
Recommended article: Computational Science – ICCS 2005
Recommended article: Heuristic and exact algorithms for a min-max selective vehicle routing problem
Recommended article: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
description: scientific article; zbMATH DE number 5060588