Approximation algorithms for some vehicle routing problems
type: Item
instance of: scholarly article
title: Approximation algorithms for some vehicle routing problems
zbMATH Open document ID: 1061.90006
author: Cristina Bazgan
author: Refael Hassin
author: Jérôme Monnot
published in: Discrete Applied Mathematics
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2137375
zbMATH Keywords: differential ratio
zbMATH Keywords: VRP
zbMATH Keywords: TSP
MaRDI profile type: Publication
full work available at URL: j.dam.2004.07.003
OpenAlex ID: W2063605597
cites work: Structure preserving reductions among convex optimization problems
cites work: Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
cites work: Q4371290
cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory
cites work: Q4526990
cites work: Q4535019
cites work: Q4198056
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Q3799801
cites work: \(z\)-approximations
cites work: Maximizing the number of unused colors in the vertex coloring problem
cites work: Better approximations for max TSP
cites work: On the completeness of a generalized matching problem
cites work: On the Distance Constrained Vehicle Routing Problem
cites work: Differential approximation results for the traveling salesman and related problems
cites work: Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
cites work: Q4782716
cites work: On the approximability of the traveling salesman problem (extended abstract)
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
cites work: P-Complete Approximation Problems
cites work: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
DOI: 10.1016/J.DAM.2004.07.003
description: scientific article; zbMATH DE number 2137375