一种准多项式时间近似的车辆路径问题
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
摘要：
在1959年由Dantzig和Ramser提出的有容量限制的车辆路径问题中，我们给定n个客户和一个仓库的位置，以及一辆容量为k的车辆，并希望找到一个最小长度的旅行集合，每个旅行从仓库开始，最多访问k个客户，其联盟覆盖所有客户。我们给出了一个准多项式时间的近似方案的设置，其中客户和仓库是在平面上，距离由欧几里德度量。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
