Trunk packing revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4525 LNCS, Issue , 2007, Pages 420-432

  Althaus, Ernst ^a   Baumann, Tobias ^a   Schömer, Elmar ^a   Werth, Kai ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Branch and bound algorithms; Branch and cut algorithms; Graph algorithms; Linear programming, packing problems; Weighted independent set

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL EFFICIENCY; GRAPH THEORY; LINEAR PROGRAMMING; STANDARDS;

BRANCH AND BOUND ALGORITHMS; GRAPH ALGORITHMS; PACKING PROBLEMS; WEIGHTED INDEPENDENT SETS;

PROBLEM SOLVING;

EID: 37149031911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_32     Document Type: Conference Paper

References (17)

1. Baumann, T., Schömer, E., Werth, K.: Solving geometric packing problems based on physics simulation. Submitted for ESA'07 (2007)
2. Berman, P.: A d/2 approximation for maximum weight independent set in d-claw free graphs. Nordic J. of Computing 7(3), 178-184 (2000)
3. Cagan, J., Ding, Q.: Automated trunk packing with extended pattern search. Virtual Engineering, Simulation & Optimization SP-1779, 33-41 (2003)
4. Eisenbrand, F., Funke, S., Karrenbauer, A., Reichel, J., Schömer, E.: Packing a trunk: now with a twist! In: SPM '05: Proceedings of the 2005 ACM symposium on Solid and physical modeling, pp. 197-206. ACM Press, New York (2005)
5. Eisenbrand, F., Funke, S., Reichel, J., Schömer, E.: Packing a trunk. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 618-629. Springer, Heidelberg (2003)
6. Deutsches Institut für Normung e.V. DIN 70020, Teil 1, Straßenfahrzeuge; Kraftfahrzeugbau; Begriffe von Abmessungen (February 1993)
7. Kako, A., Ono, T., Hirata, T., Halldórsson, M.M.: Approximation algorithms for the weighted independent set problem. In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG, pp. 341-350 (2005)
8. Karrenbauer, A.: Packing boxes with arbitrary rotations. Master's thesis, Universität des Saarlandes, Saarbrücken (2004)
9. Neumann, U.: Optimierungsverfahren zur normgerechten Volumenbestimmung von Kofferräumen im europäischen Automobilbau. Master's thesis, Technische Universität Braunschweig, Braunschweig (2006)
10. Society of Automotive Engineers. SAE J1100, Motor Vehicle Dimensions (February 2001)
11. Reichel, J.: Combinatorial approaches for the Trunk packing problem. PhD thesis, Saarbrücken (2006)
12. Rieskamp, J.: Automation and Optimization of Monte Carlo Based Trunk Packing. Master's thesis, Universität des Saarlandes, Saarbrücken (2005)
13. Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithms for the maximum weighted independent set problem. Discrete Appl. Math. 126(2-3), 313-322 (2003)
14. Schepers, J.: Exakte Algorithmen für orthogonale Packungsprobleme. PhD thesis, Köln (1997)
15. Warren, J.S., Hicks, I.V.: Combinatorial branch-and-bound for the maximum weight independent set problem, http://ie.tamu.edu/people/faculty/Hicks/jeff. rev.pdf (2006)
16. Wottawa, M.: Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen. PhD thesis, Köln (1996)
17. Zimmermann, A.: AI Zimmerman's Circle Packing Contest. Al Zimmerman's Programming Contests, http://www.recmath.org/contest/CirclePacking/ (2005)