A branch and bound algorithm for the strip packing problem

OR Spectrum

Volumn 31, Issue 2, 2009, Pages 431-459

  Alvarez Valdes, R ^a   Parreno F ^b   Tamarit, J M ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

Branch and bound; Lower bounds; Non guillotine cutting; Strip packing

Indexed keywords

EID: 59549098139     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-008-0128-5     Document Type: Article

References (20)

1. R Alvarez-Valdes F Parreño JM Tamarit 2008 Reactive GRASP for the Strip-packing problem Comput Oper Res 35 1065 1083
2. JE Beasley 1985 Algorithms for unconstrained two-dimensional guillotine cutting J Oper Res Soc 36 297 306
3. JE Beasley 1985 An exact two-dimensional non-guillotine cutting tree search procedure Oper Res 33 49 64
4. BE Bengtsson 1982 Packing rectangular pieces-a heuristic approach Comput J 25 353 357
5. JO Berkey PY Wang 1987 Two dimensional finite bin packing algorithms J Oper Res Soc 38 423 429
6. Boschetti MA, Mingozzi A (2003) The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case, 4OR, vol 1, pp 27-42
7. MA Boschetti A Mingozzi E Hadjiconstantinou 2002 New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem IMA J Manag Math 13 95 119
8. J Carlier F Clautiaux A Moukrim 2007 New reduction procedures and lower bounds for the two dimensional bin packing problem with fixed orientation Comput Oper Res 34 2223 2250
9. N Christofides C Whitlock 1977 An algorithm for two-dimensional cutting problems Oper Res 25 30 44
10. SP Fekete J Schepers 2004 A general framework for bounds for higher-dimensional orthogonal packing problems Math Methods Oper Res 60 311 329
11. SP Fekete J Schepers JC van der Veen 2007 An exact algorithm for higher-dimensional orthogonal packing Oper Res 55 569 590
12. E Hopper CH Turton 2001 An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem Eur J Oper Res 128 34 57
13. Johnson DS (1973) Near-optimal bin packing algorithms. Ph.D. Thesis, Massachussets Institute of Technology
14. NB Lesh J Marks A McMahon M Mitzenmacher 2004 Exhaustive approaches to 2D rectangular perfect packings Inf Process Lett 90 7 14
15. A Lodi S Martello M Monaci 2003 Two-dimensional packing problems: a survey Eur J Oper Res 141 241 252
16. Lueker GS (1983) Bin packing with items uniformly distributed over intervals [a,b]. In: Proc. 24th IEEE annu. found. comp. sci. (FOCS 83), pp 289-297
17. S Martello D Vigo 1998 Exact solution of the two-dimensional finite bin packing problem Manag Sci 44 388 399
18. S Martello D Pisinger D Vigo 2000 The three dimensional bin packing problem Oper Res 48 256 267
19. S Martello M Monaci D Vigo 2003 An exact approach to the strip packing problem INFORMS J Comput 15 3 310 319
20. G Wäscher H Haussner H Schumann 2007 An improved typology of cutting and packing problems Eur J Oper Res 183 1109 1130