An Exact Approach to the Strip-Packing Problem

References

• Baker B. S., Brown D. J., Katseff H. P. A 5/4 algorithm for two-dimensional packing. J. of Algorithms (1981) 2:348–368Crossref, Google Scholar
• Baker B. S., Coffman E. G., Rivest R. L. Orthogonal packing in two dimensions. SIAM J. on Comp. (1980) 9:846–855Crossref, Google Scholar
• Baker D. S., Schwarz J. S. Shelf algorithms for two-dimensional packing problems. SIAM J. on Comp. (1983) 12:508–525Crossref, Google Scholar
• Beasley J. E. Algorithms for unconstrained two-dimensional guillotine cutting. J. of Oper. Res. Soc. (1985a) 36:297–306Crossref, Google Scholar
• Beasley J. E. An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. (1985b) 33:49–64Link, Google Scholar
• Beasley J. E. OR-library: distributing test problems by electronic mail. J. of the Oper. Res. Soc. (1990) 41:1069–1072Crossref, Google Scholar
• Bengtsson B. E. Packing rectangular pieces—A heuristic approach. The Comput. J. (1982) 25:353–357Crossref, Google Scholar
• Berkey J. O., Wang P. Y. Two dimensional finite bin packing algorithms. J. of Oper. Res. Soc. (1987) 38:423–429Crossref, Google Scholar
• Brown D. J. An improved BL lower bound. Inform. Processing Lett. (1980) 11:37–39Crossref, Google Scholar
• Christofides N., Whitlock C. An algorithm for two-dimensional cutting problems. Oper. Res. (1977) 25:30–44Link, Google Scholar
• Chung F. K. R., Garey M. R., Johnson D. S. On packing two-dimensional bins. SIAM J. of Algebraic and Discrete Methods (1982) 3:66–76Crossref, Google Scholar
• Coffman G.E., Garey M. R., Johnson D. S. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. on Comput. (1980) 9:801–826Crossref, Google Scholar
• Dyckhoff H., Scheithauer G., Terno J., Dell'Amico M., Maffioli F., Martello S. Cutting and packing (C&P). Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley & Sons, Chichester, U.K) 393–413Google Scholar
• Fekete S. P., Schepers J. On more-dimensional packing I: Modeling. (1997a) . Technical Report ZPR97-288, Mathematisches Institut, Universität zu Köln, Köln, GermanyGoogle Scholar
• Fekete S. P., Schepers J. On more-dimensional packing II: Bounds. (1997b) . Technical Report ZPR97-289, Mathematisches Institut, Universität zu Köln, Köln, GermanyGoogle Scholar
• Fekete S. P., Schepers J. On more-dimensional packing III: Exact algorithms. (1997c) . Technical Report ZPR97-290, Mathematisches Institut, Universität zu Köln, Köln, GermanyGoogle Scholar
• Golan I. Performance bounds for orthogonal oriented two-dimensional packing algorithms. SIAM J. on Comput. (1981) 10:571–582Crossref, Google Scholar
• Hopper E., Turton B. C. H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. of Oper. Res. (2001) 128:34–57Crossref, Google Scholar
• Høyland S., Karlsson R. G., Lingas A. Bin-packing in 1.5 dimension. Lecture Notes in Computer Science (1988) (Springer-Verlag, Berlin, Germany) 129–137Crossref, Google Scholar
• Johnson D. S. Near-optimal bin packing algorithms. (1973) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Lodi A., Martello S., Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. on Comput. (1999) 11:345–357Link, Google Scholar
• Lodi A., Martello S., Vigo D. Recent advances on two-dimensional bin packing problems. Discrete Applied Math. (2002) 123/124:373–390Google Scholar
• Martello S., Pisinger D., Vigo D. The three dimensional bin packing problem. Oper. Res. (2000) 48:256–267Link, Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990a) (John Wiley & Sons, Chichester, UK) Google Scholar
• Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. (1990b) 28:59–70Crossref, Google Scholar
• Martello S., Vigo D. Exact solution of the finite two-dimensional bin packing problem. Management Sci. (1998) 44:388–399Link, Google Scholar
• Pisinger D., den Boef E., Korst J., Martello S., Vigo D. Robot-packable and general variants of the three-dimensional bin packing problem. (2001) . Technical Report 01/05, DIKU, University of Copenhagen, Copenhagen, DenmarkGoogle Scholar
• Scheithauer G. Equivalence and dominance for problems of optimal packing of rectangles. Ricerca Operativa (1997) 83:3–34Google Scholar
• Sleator D. A 2.5 times optimal algorithm for packing in two dimensions. Inform. Processing Lett. (1980) 10:37–40Crossref, Google Scholar
• Steinberg A. A strip-packing algorithm with absolute performance bound 2. SIAM J. on Comput. (1997) 26:401–409Crossref, Google Scholar