Abstract
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(ε-4)), which is better than the previous one O(n (1/ε)O(1/ε), where n is the number of input elements. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Chen, J., Guo, H., Han, X., & Iwama, K. (2013). The train delivery problem revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 601–611). Springer Verlag. https://doi.org/10.1007/978-3-642-45030-3_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
