Packing small boxes into a big box

Mathematical Methods of Operations Research

Volumn 52, Issue 1, 2000, Pages 1-21

  Padberg, Manfred ^a  

^a Stat and Operations Res Department   (United States)

Author keywords

Cutting planes; Facets of polyhedra; Mixed integer programming; Polyhedral combinatorics; Three dimensional packing

Indexed keywords

EID: 0347318536     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000066     Document Type: Article

References (28)

1. Applegate D, Bixby R, Chvátal V, Cook W (1998) On the Solution of Traveling Salesman Problems, Documenta Mathematica: Extra Vol. ICM, III 645-656
2. Barahona F, Jünger M, Reinelt G (1989) Experiments in Quadratic 0-1 Programming, Mathematical Programming, 44, 1989, 127-137
3. Barahona F, Mahjoub R (1986) On the Cut Polytope, Mathematical Programming, 36, 1986, 157-173
4. Beasley J (1985) An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure, Operations Research, 33, 1985, 49-64
5. Christofides N, Whitlock C (1977) An Algorithm for Two-Dimensional Cutting Problems, Operations Research, 25, 1977, 30-44
6. Christofides N, Mingozzi A, Toth P (1979) Loading Problems, in Christofides, Mingozzi. Toth and Sandi (eds), Combinatorial Optimization, Wiley, New York, 339-369
7. De Simone C, Diehl M, Jünger M, Mutzel P, Reinelt G, Rinaldi G (1996) Exact Ground States of Two-Dimensional ±J Ising Spin Glasses, Journal of Statistical Physics, 84, 1996, 1363-1371
8. Deza M, Laurent M (1998) Cuts and Metrics, Springer Verlag, Heidelberg
9. Dyckhoff H, Scheithauer G, Terno J (1997) Cutting and Packing, in Dell'Amico, Maffioli and Martello (eds), Annotated Bibliographies in Combinatorial Optimization, Wiley, New York, 393-413
10. Fasano G (1999) Cargo Analytical Integration in Space Engineering: a Three-Dimensional Packing Model, in Ciriani, Gliozzi and Johnson (eds), Operational Research in Industry, MacMillan
11. Fekete S, Schepers J (1997) A New Exact Algorithm for General Orthogonal d-Dimensional Knapsack Problems, in Proceedings of the 5th European Symposium on Algorithm (ESA 97), 1997
12. Grötschel M, Padberg M (1999) Die optimierte Odyssee, Spektrum der Wissenschaft, April 1999; reprinted in special issue Wissenschafliches Rechnen (Scientific Computing), October 1999; translated into French "L'Odyssée abregée". Pour la Science, August 1999
13. Grötschel M, Padberg M (1999) Die optimierte Odyssee, Spektrum der Wissenschaft, April 1999; reprinted in special issue Wissenschafliches Rechnen (Scientific Computing), October 1999; translated into French "L'Odyssée abregée". Pour la Science, August 1999
14. Grötschel M, Padberg M (1999) Die optimierte Odyssee, Spektrum der Wissenschaft, April 1999; reprinted in special issue Wissenschafliches Rechnen (Scientific Computing), October 1999; translated into French "L'Odyssée abregée". Pour la Science, August 1999
15. Grötschel M, Jünger M, Reinelt G (1985) Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a Cutting Plane Algorithm in Rival (ed.), Graphs and Orders, D. Reidel Publishing Co, Holland, 1985, 217-264
16. Hadjiconstantinou E, Christofides N (1995) An Exact Algorithm for General, Orthogonal, Two-Dimensional Knapsack Problems, European Journal of Operational Research, 83, 1995, 39-56
17. Hoffman K, Padberg M (1991) Improving the LP-Representation of Zero-One Linear Programming Problems for Branch and Cut, ORSA Journal on Computing, 3, 1991, 121-134
18. Jünger M, Reinelt G, Thienel S (1995) Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20, 1995, 111-152
19. Martello S, Vigo D (1996) Exact Solution of the Two-Dimensional Bin Packing Problem, Research Report DEIS-OR-96-3, University of Bologna, 1996
20. Martello S, Pisinger D, Vigo D (1997) The Three-Dimensional Bin Packing Problem, Research Report DEIS-OR-97-6, University of Bologna, 1997
21. Padberg M (1989) The Boolean Polytope: Some Characteristics, Facets and Relatives, Mathematical Programming, 45, 1989, 139-172
22. nd ed
23. Padberg M, Rijal M (1996) Location, Scheduling, Design and Integer Programming, Kluwer Academic Publishers, Boston
24. Padberg M, Rinaldi G (1991) A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, SIAM Review, 33, 1991, 60-100
25. Scheithauer G, Terno J (1993) Modelling of Packing Problems, Optimization, 28, 1993, 63-84
26. Schepers J (1997) Exakte Algorithmen für orthogonale Packungsprobleme, Doctoral Dissertation, Angewandte Mathematik und Informatik, Universität zu Köln
27. Schrijver A (ed) (1978) Stapelen en Overdekken, Syllabus, Studieweek 5 t/m 9 juni 1978, Stichting Mathematisch Centrum, Amsterdam
28. Wottowa M (1996) Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen, Doctoral Dissertation, Angewandte Mathematik und Informatik, Universität zu Köln