当前位置:
X-MOL 学术
›
ACM Trans. Algorithms
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A PTAS for Capacitated Vehicle Routing on Trees
ACM Transactions on Algorithms ( IF 1.3 ) Pub Date : 2023-03-10 , DOI: https://dl.acm.org/doi/10.1145/3575799 Claire Mathieu, Hang Zhou
中文翻译:
一种用于树木上有能力的车辆路径的 PTAS
更新日期:2023-03-10
ACM Transactions on Algorithms ( IF 1.3 ) Pub Date : 2023-03-10 , DOI: https://dl.acm.org/doi/10.1145/3575799 Claire Mathieu, Hang Zhou
We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, for the entire range of the tour capacity. The result extends to the splittable CVRP.
中文翻译:
一种用于树木上有能力的车辆路径的 PTAS
对于整个旅游容量范围,我们为树上的单位需求容量车辆路径问题 (CVRP) 提供多项式时间近似方案 (PTAS)。结果扩展到可拆分的 CVRP。