A PTAS for Capacitated Vehicle Routing on Trees
International Colloquium on Automata, Languages and Programming (ICALP)(2023)
摘要
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.
更多查看译文
关键词
Approximation algorithms,capacitated vehicle routing,graph algorithms,combinatorial optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要