Trunk packing revisited

11Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Althaus, E., Baumann, T., Schömer, E., & Werth, K. (2007). Trunk packing revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 420–432). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free