One-dimensional relaxations and LP bounds for orthogonal packing

International Transactions in Operational Research

Volumn 16, Issue 6, 2009, Pages 745-766

  Belov, G ^a   Kartak, V ^b   Rohling, H ^a   Scheithauer, G ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b Science and Education Center of Bashkir People History Ufa University of Science and Technology   (Russian Federation)

Author keywords

Conservative scales; Dual feasible function; Modeling; Packing; Probing; Relaxation

Indexed keywords

EID: 84956801161     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2009.00713.x     Document Type: Article

References (31)

1. Achterberg, T., Koch, T., Martin, A., 2005. Branching rules revisited. Operations Research Letters 33, 1, 42–54.
2. Alvarez-Valdes, R., Parreño, F., Tamarit, J.M., 2009. A branch and bound algorithm for the strip packing problem. OR Spectrum 31, 2, 431–459.
3. Alves, C., Valério de Carvalho, J.M., 2008. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers and Operations Research 35, 4, 1315–1328.
4. Baldacci, R., Boschetti, M.A., 2007. A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. European Journal of Operational Research 183, 3, 1136–1149.
5. Beasley, J.E., 1985. Bounds for two-dimensional cutting. Journal of the Operational Research Society 36, 1, 71–74.
6. Beldiceanu, N., Carlsson, M., Poder, E., 2008. New filtering for the cumulative constraint in the context of non-overlapping rectangles. In Perron, L., Trick, M.A. (eds) CPAIOR. LNCS Vol. 5015, Springer-verlag, Berlin, pp. 21–35.
7. Belov, G., Scheithauer, G., 2007. Setup and open-stacks minimization in one-dimensional stock cutting. INFORMS Journal on Computing 19, 1, 27–35.
8. Belov, G., Scheithauer, G., Mukhacheva, E.A., 2008. One-dimensional heuristics adapted for two-dimensional rectangular strip packing. Journal of the Operational Research Society 59, 823–832.
9. Berkey, J.O., Wang, P.Y., 1987. Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society 38, 5, 423–429.
10. Bortfeldt, A., 2006. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research 172, 3, 814–837.
11. Caprara, A., Locatelli, M., Monaci, M., 2005. Bidimensional packing by bilinear programming. In Jünger, M., Kaibel, V. (eds) Proceedings of the Eleventh Conference on Integer Programming and Combinatorial Optimization (IPCO'05), LNCS Vol. 3509. Springer-Verlag, Berlin, pp. 377–391.
12. Carlier, J., Clautiaux, F., Moukrim, A., 2009. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers and Operations Research 34, 8, 2223–2250.
13. Clautiaux, F., Alves, C., Valério de Carvalho, J., 2009. A survey of dual-feasible functions for bin-packing problems. Annals of Operations Research, doi: DOI: 10.1007/s10479-008-0453-8.
14. Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A., 2008. A new constraint programming approach for the orthogonal packing problem. Computers and Operations Research 35, 3, 944–959.
15. Fekete, S.P., Schepers, J., 2004a. A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research 29, 2, 353–368.
16. Fekete, S.P., Schepers, J., 2004b. A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research 60, 2, 311–329.
17. Fekete, S.P., Schepers, J., Van Der Veen, J., 2007. An exact algorithm for higher-dimensional orthogonal packing. Operations Research 55, 3, 569–587.
18. Fekete, S.P., Van Der Veen, J., 2005. Two-dimensional strip packing in reconfigurable computing. The 2nd ESICUP Meeting, Southampton.
19. Gilmore, P.C., Gomory, R.E., 1961. A linear programming approach to the cutting-stock problem. Operations Research 9, 849–859.
20. Letchford, A.N., Amaral, A., 2001. Analysis of upper bounds for the pallet loading problem. European Journal of Operational Research 132, 3, 582–593.
21. Martello, S., Monaci, M., Vigo, D., 2003. An exact approach to the strip-packing problem. INFORMS Journal on Computing 15, 3, 310–319.
22. Martello, S., Vigo, D., 1998. Exact solution of the finite two-dimensional bin packing problem. Management Science 44, 3, 388–399.
23. Martin, A., 2001. General mixed-integer programming: Computational issues for branch-and-cut algorithms. In Jünger, M., Naddef, D. (eds) Computational Combinatorial Optimization, LNCS Vol. 2241, Springer-Verlag, Berlin, pp. 1–25.
24. Padberg, M., 2000. Packing small boxes into a big box. Mathematical Methods of Operations Research 52, 1, 1–21.
25. Pisinger, D., Sigurd, M.M., 2007. Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS Journal on Computing 19, 1, 36–51.
26. Rietz, J., Scheithauer, G., Terno, J., 2002. Families of non-IRUP instances of the one-dimensional cutting stock problem. Discrete Applied Mathematics 121, 229–245.
27. Scheithauer, G., 1999. LP-based bounds for the container and multi-container loading problem. International Transactions in Operational Research 6, 2, 199–213.
28. Scheithauer, G., 2008. Cutting and Packing Problems. Vieweg+Teubner Verlag, Wiesbaden (in German).
29. Simonis, H., O'Sullivan, B., 2008. Search strategies for rectangle packing. In Stuckey, P.J. (ed.) Principles and Practice of Constraint Programming, LNCS Vol. 5202. Springer, Berlin, pp. 52–66.
30. Valério de Carvalho, J.M., 2002. LP models for bin-packing and cutting stock problems. European Journal of Operational Research 141, 2, 253–273.
31. Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L., 1994. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3, 2, 111–130.