LP bounds in an interval-graph algorithm for orthogonal-packing feasibility

Operations Research

Volumn 61, Issue 2, 2013, Pages 483-497

  Belov, Gleb ^a   Rohling, Heide ^b  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Branch and price; Dimension reduction; Interval graph; Packing

Indexed keywords

BRANCH AND PRICE; CUTTING-STOCK PROBLEMS; DIMENSION REDUCTION; FEASIBILITY PROBLEM; HIGHER-DIMENSIONAL; INTERVAL GRAPH; OVERLAPPING INFORMATION; RECTANGULAR CONTAINERS;

COMPUTER APPLICATIONS; OPERATIONS RESEARCH; PACKING;

ALGORITHMS;

EID: 84877857502     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1150     Document Type: Article

References (32)

1. Alvarez-Valdes R, Parreño F, Tamarit JM (2009) A branch and bound algorithm for the strip packing problem. OR Spectrum 31(2):431-459.
2. Amaral A, Letchford AN (2003) An improved upper bound for the two-dimensional non-guillotine cutting problem. Technical report, Lancaster University, Lancaster, UK.
3. Baldacci R, Boschetti MA (2007) A cutting-plane approach for the twodimensional orthogonal non-guillotine cutting problem. Eur. J. Oper. Res. 183(3):1136-1149. (Pubitemid 47030732)
4. Beasley JE (1985) Bounds for two-dimensional cutting. J. Oper. Res. Soc. 36(1):71-74. (Pubitemid 15460768)
5. Beldiceanu N, Carlsson M, Demassey S, Poder E (2011) New filtering for the cumulative constraint in the context of non-overlapping rectangles. Ann. Oper. Res. 184:27-50.
6. Belov G, Kartak V, Rohling H, Scheithauer G (2009) One-dimensional relaxations and LP bounds for orthogonal packing. Internat. Trans. Oper. Res. 16(6):745-766.
7. Belov G, Kartak V, Rohling H, Scheithauer G (2013) Conservative scales in packing problems. OR Spectrum 35(2):505-542.
8. Boschetti MA, Montaletti L (2010) An exact algorithm for the twodimensional strip-packing problem. Oper. Res. 58(6):1774-1791.
9. Boschetti MA, Mingozzi A, Hadjiconstantinou E (2002) New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem. IMA J. Management Math. 13(2):95-119.
10. Caprara A, Monaci M (2009) Bidimensional packing by bilinear programming. Math. Programming 118(1):75-108.
11. Clautiaux F, Jouglet A, Moukrim A (2008b) A new graph-theoretical model for k-dimensional guillotine-cutting problems. McGeoch CC, ed. Experimental Algorithms. Lecture Notes in Computer Science, Vol. 5038 (Springer, Berlin), 43-54.
12. Clautiaux F, Jouglet A, Carlier J, Moukrim A (2008a) A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35(3):944-959. (Pubitemid 47368856)
13. Fekete SP, Schepers J (2004a) A combinatorial characterization of higherdimensional orthogonal packing. Math. Oper. Res. 29(2):353-368.
14. Fekete SP, Schepers J (2004b) A general framework for bounds for higherdimensional orthogonal packing problems. Math. Methods Oper. Res. 60(2):311-329.
15. Fekete SP, Schepers J, van der Veen J (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55(3):569-587. (Pubitemid 351159510)
16. Ferreira EP, Oliveira JF (2008) Fekete and Schepers' graph-based algorithm for the two-dimensional orthogonal packing problem revisited. Bortfeldt A, Homberger J, Kopfer H, Pankratz G, Strangmeier R, eds. Intelligent Decision Support (Gabler, Wiesbaden, Germany), 15-31.
17. Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem (Part I). Oper. Res. 9:849-859.
18. Golumbic MC (2004) Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, 2nd ed., Vol. 57 (Elsevier B.V., Amsterdam).
19. Hopper E (2000) Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. thesis, Cardiff University, Cardiff, UK.
20. Hopper E, Turton BCH (2000) An empirical investigation of metaheuristic and heuristic algorithms for a 2D-packing problem. Eur. J. Oper. Res. 128(1):34-57.
21. Kenmochi M, Imamichi T, Nonobe K, Yagiura M, Nagamochi H (2009) Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198(1):73-83.
22. Korf RE (2004) Optimal rectangle packing: New results. Zilberstein S, Koehler J, Koenig S, eds. Proc. Fourteenth Internat. Conf. Automated Planning and Scheduling (ICAPS 2004) (Whistler, British Columbia, Canada), 142-149. (Pubitemid 40201840)
23. Macedo R, Alves C, Valério de Carvalho JM (2010) Arc-flow model for the two-dimensional guillotine cutting stock problem. Comput. Oper. Res. 37(6):991-1001.
24. Martello S, Monaci M, Vigo D (2003) An exact approach to the strippacking problem. INFORMS J. Comput. 15(3):310-319.
25. Martin A (2001) General mixed-integer programming: Computational issues for branch-and-cut algorithms. Jünger M, Naddef D, eds. Computational Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 2241 (Springer, Berlin), 1-25. (Pubitemid 33369825)
26. Mesyagutov M, Scheithauer G, Belov G (2012) LP bounds in various constraint programming approaches for orthogonal packing. Comput. Oper. Res. 39(10):2425-2438.
27. Padberg M (2000) Packing small boxes into a big box. Math. Methods Oper. Res. 52(1):1-21.
28. Pisinger D, Sigurd MM (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J. Comput. 19(1):36-51.
29. Rietz J, Scheithauer G, Terno J (2002) Families of non-IRUP instances of the one-dimensional cutting stock problem. Discrete Appl. Math. 121:229-245.
30. Rohling H (2008) LP bounds in exact algorithms for two-dimensional orthogonal packing. Diploma thesis, Dresden University of Technology, Dresden, Germany.
31. Scheithauer G (1999) LP-based bounds for the container and multicontainer loading problem. Internat. Trans. Oper. Res. 6(2):199-213.
32. Simonis H, O'Sullivan B (2008) Search strategies for rectangle packing. Stuckey PJ, ed. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, Vol. 5202 (Springer, Berlin), 52-66.