Multi-dimensional bin packing problems with guillotine constraints

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 1999-2006

  Amossen, Rasmus R ^a   Pisinger, David ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Constraint programming; Cutting; Packing

Indexed keywords

BIN PACKING PROBLEM; CONSTRAINT PROGRAMMING; CONSTRUCTIVE ALGORITHMS; DECISION PROBLEMS; GUILLOTINE CONSTRAINT; NP-HARD; RECTANGULAR BOX;

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; CUTTING;

BINS;

EID: 77951295361     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.01.017     Document Type: Article

References (30)

1. Amossen RR. Constructive algorithms and lower bounds for guillotine cuttable orthogonal bin packing problems. Master's thesis, Department of Computer Science, University of Copenhagen, 2005.
2. Baldacci R., and Boschetti M.A. A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. European Journal of Operational Research 183 (2007) 1136-1149
3. Bediceanu N, Carlsson M. Sweep as a generic pruning technique applied to the non-overlapping rectangles constraints. In: Principles and Practice of Constraint Programming (CP'2001), vol. 2239, Springer, 2001. p. 377-91.
4. Bediceanu N., Carlsson M., and Thiel S. Sweep synchronization as a global propagation mechanism. Computers and Operations Research 33 (2006) 2835-2851
5. Belov G. Problems, Models and algorithms in one- and two-dimensional cutting. PhD thesis, Technischen Universität Dresden, 2003.
6. Belov G., Kartak V., Rohling H., and Scheithauer G. One-dimensional relaxations and lp bounds for orthogonal packing. International Transactions in Operational Research 16 (2009) 745-766
7. Clautiaux F, Alves C, Valerio de Carvalho J. A survey of dual feasible and superadditive functions. Annals of Operations Research, 2008.
8. Clautiaux F, Alves C, Valério de Carvalho J. A survey of dual-feasible functions for bin-packing problems. Annals of Operations Research, 2009. p. 1-26 doi: 10.1007/s10479-008-0453-8.
9. Cung V-D, Hifi M, Le Cun B. Constrained tow-dimensional cutting stock problems -a best-first branch-and-bound algorithm. Technical Report 97/020, Laboratorie PRISM, University of Versailles, France, 1997.
10. Clautiaux F., Jouglet A., Carlier J., and Moukrim A. A new constraint programming approach for the orthogonal packing problem. Computers and Operations Research 35 (2008) 944-959
11. Chen C.S., Lee S.M., and Shen Q.S. An analytical model for the container loading problem. European Journal of Operational Research 80 (1995) 68-76
12. Clautiaux F. Moukrim A. On graph-theoretical models for k-dimensional guillotine-cutting problems, In: Third ESICUP meeting, Porto, Portugal, March 16-18, 2006.
13. Christofides N., and Whitlock C. An algorithm for two dimensional cutting problems. Operations Research 25 (1977) 30-44
14. Dantzig G.B., and Wolfe P. Decomposition principle for linear programs. Operations Research 8 (1960) 101-111
15. Fekete SP, Schepers J. On higher-dimensional packing I: Modeling. Technical Report 97-288, University at zu Köln, 1997.
16. Fekete S., and Schepers J. A combinatorial characterization of higher-dimensional orthogonal packings. Mathematics of Operations Research 29 (2004) 353-368
17. Fekete S.P., and Schepers J. A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research 29 2 (2004) 353-368
18. Fekete S., Schepers J., and Van der Veen J. An exact algorithm for higher-dimensional orthogonal packings. Operations Research 55 (2007) 569-587
19. Garey M, Johnson D. Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, January 1975. URL: http://link.aip.org/link/?SMJCAT/4/397/1.
20. Hifi M. An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock. Computers and Operations Research 24 (1997) 727-736
21. Hifi M. Exact algorithms for the guillotine strip cutting/packing problem. Computers and Operations Research 25 (1998) 925-940
22. Martello S., Pisinger D., and Vigo D. The three-dimensional bin packing problem. Operations Research 48 (2000) 256-267
23. Martello S., Pisinger D., Vigo D., den Boef E., and Korst J. Algorithm 864: general and robot-packable variants of the three-dimensional bin packing problem. ACM Transactions on Mathematical Software 33 (2007) 7
24. Parada V., Palma R., Sales D., and Gómes A. A comparative numerical analysis for the guillotine two-dimensional cutting problem. Annals of Operations Research 96 (2000) 245-254
25. Pisinger D., and Sigurd M.M. The two-dimensional variable-sized bin packing problem. Discrete Optimization 2 (2005) 154-167
26. Pisinger D., and Sigurd M.M. Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. INFORMS Journal on Computing 19 (2007) 36-51
27. Scheithauer G. Algorithms for the container loading problem. Operations Research Proceedings 1991, 1992. p. 445-52.
28. Viswanathan K.V., and Bagchi A. Best-first search methods for constrained two-dimensional cutting stock problem. Operations Research 41 (1993) 768-776
29. Wang P.Y. Two algorithms for constrained two-dimensional cutting stock problems. Opererations Research 31 (1983) 573-586
30. Wong DF, Liu CL. A new algorithm for floorplan design. In: DAC '86: Proceedings of the 23rd ACM/IEEE conference on design automation, Piscataway, NJ, USA, 1986. IEEE Press. p. 101-7.