A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
Discrete Mathematics
2008-12-10 v1 Data Structures and Algorithms
Abstract
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, and wish to find a minimum length collection of tours, each starting from the depot and visiting at most k customers, whose union covers all the customers. We give a quasi-polynomial time approximation scheme for the setting where the customers and the depot are on the plane, and distances are given by the Euclidean metric.
Keywords
Cite
@article{arxiv.0812.1595,
title = {A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing},
author = {Aparna Das and Claire Mathieu},
journal= {arXiv preprint arXiv:0812.1595},
year = {2008}
}