A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing

Authors:
Aparna Das;Claire Mathieu
Affiliations:
Brown University-Computer Science;Brown University-Computer Science
Venue:
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Year:
2010

Citing 10
Cited 3

Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Approximation schemes for minimum latency problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
The vehicle routing problem

The vehicle routing problem
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A quasi-polynomial time approximation scheme for minimum weight triangulation

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A Nearly Linear-Time Approximation Scheme for the Euclidean $k$-Median Problem

SIAM Journal on Computing
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science

PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Capacitated vehicle routing with non-uniform speeds

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Technical Note---Approximation Algorithms for VRP with Stochastic Demands

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.