Journal
ALGORITHMICA
Volume 73, Issue 1, Pages 115-142Publisher
SPRINGER
DOI: 10.1007/s00453-014-9906-4
Keywords
Geometric algorithm; Approximation algorithms; Vehicle routing; Combinatorial optimization
Funding
- NSF [CCF-0728816]
Ask authors/readers for more resources
In the capacitated vehicle routing problem we are given the locations of customers and depots, along with a vehicle of capacity . The objective is to find a minimum length collection of tours covering all customers such that each tour starts and end at a depot and visits at most customers. The problem is a generalization of the traveling salesman problem. We present a quasipolynomial time approximation scheme for the Euclidean setting of the problem when all points lie in for constant dimension .
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available