2008/12/08 by Aparna Das, Das, Aparna, Claire Mathieu +1 · 1 citation
Business, Management and Accounting · Computer Science · Engineering · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Facility Location and Emergency Management #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.0812.1595
openalex publication_date 2008/12/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.