The Train Delivery Problem Revisited.

ALGORITHMS AND COMPUTATION（2013）

引用 1|浏览8

暂无评分

摘要

In this paper, we study the train delivery problem which is a generalization of the bin packing problem, and is also equivalent to a one dimensional version of the vehicle routing problem with unsplittable demands. We give an APTAS for the general problem with time complexity O(n(O(epsilon-4))), which is better than the previous one O(n((1/epsilon)O(1/epsilon))), where n is the number of input elements.

查看译文

关键词

Layered Graph, Total Size, Small Element, Full Version, Consecutive Layer

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要