树上有能力车辆路径的PTAS
IF 0.9
3区 计算机科学
Q3 COMPUTER SCIENCE, THEORY & METHODS
引用次数: 0
摘要
针对单位需求车辆路径问题(CVRP)，在整个行程容量范围内，给出了一个多项式时间逼近格式(PTAS)。结果扩展到可分割的CVRP。本文章由计算机程序翻译，如有差异，请以英文原文为准。
A PTAS for Capacitated Vehicle Routing on Trees
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.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。
去求助
来源期刊
ACM Transactions on Algorithms
COMPUTER SCIENCE, THEORY & METHODS-MATHEMATICS, APPLIED
CiteScore
3.30
自引率
0.00%
发文量
50
审稿时长
6-12 weeks
期刊介绍：
ACM Transactions on Algorithms welcomes submissions of original research of the highest quality dealing with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis. Most welcome are new algorithms and data structures, new and improved analyses, and complexity results. Specific areas of computation covered by the journal include
combinatorial searches and objects;
counting;
discrete optimization and approximation;
randomization and quantum computation;
parallel and distributed computation;
algorithms for
graphs,
geometry,
arithmetic,
number theory,
strings;
on-line analysis;
cryptography;
coding;
data compression;
learning algorithms;
methods of algorithmic analysis;
discrete algorithms for application areas such as
biology,
economics,
game theory,
communication,
computer systems and architecture,
hardware design,
scientific computing
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
