Packing a Trunk

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

Volumn 2832, Issue , 2003, Pages 618-629

  Eisenbrand, Friedrich ^a   Funke, Stefan ^a   Reichel, Joachim ^a   Schömer, Elmar ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; MANUFACTURE;

CAR MANUFACTURERS; EUROPEAN UNION; GEOMETRIC STRUCTURE; INTEGER LINEAR PROGRAMMING; NP COMPLETE; OPTIMAL SOLUTIONS; PACKING PROBLEMS; POLYHEDRAL MODELING;

AUTOMOBILE MANUFACTURE;

EID: 0142183784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_56     Document Type: Article

References (13)

1. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman (1979)
2. Fowler, R.F., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12 (1981) 133-137
3. Milenkovic, V.J.: Rotational polygon containment and minimum enclosure using only robust 2d constructions. Computational Geometry 13 (1999) 3-19
4. Daniels, K., Milenkovic, V.J.: Column-based strip packing using ordered and compliant containment. In: 1st ACM Workshop on Applied Computational Geometry (WACG). (1996) 33-38
5. Cagan, J., Shimada, K., Yin, S.: A survey of computational approaches to threedimensional layout problems. Computer-Aided Design 34 (2002) 597-611
6. Verweij, B., Aardal, K.: An optimisation algorithm for maximum independent set with applications in map labelling. In: Algorithms - ESA '99 (Prague). Volume 1643 of Lecture Notes in Comput. Sei. Springer, Berlin (1999) 426-437
7. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Volume 2 of Algorithms and Combinatorics. Springer (1988)
8. Padberg, M.W.: On the facial structure of set packing polyhedra. Mathematical Programming 5 (1973) 199-215
9. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197
10. Chvátal, V.: On certain polytopes associated with graphs. Journal of Combinatorial Theory Ser. B 18 (1975) 138-154
11. Wolsey, L.: Faces for a linear inequality in 0-1 variables. Mathematical Programming 8 (1975) 165-178
12. Nemhauser, G.L., Wolsey, L.A.: Integer programming. In et al., G.L.N., ed.: Optimization. Volume 1 of Handbooks in Operations Research and Management Science. Elsevier (1989) 447-527
13. Gerards, A.M.H., Schrijver, A.: Matrices with the Edmonds-Johnson property. Combinatorica 6 (1986) 365-379