Data Structures for Higher-Dimensional Rectilinear Packing

References

• Allen S., Burke E. K., Hyde M., Kendall G. Evolving reusable 3D packing heuristics with genetic programming. GECCO '09: Proc. 11th Annual Conf. Genetic Evolutionary Comput. (2009) (ACM, New York) 931–938Crossref, Google Scholar
• Allen S. D., Burke E. K., Kendall G. A hybrid placement strategy for the three-dimensional strip packing problem. Eur. J. Oper. Res. (2011) 209(3):219–227Crossref, Google Scholar
• Bischoff E. E. Three-dimensional packing of items with limited load bearing strength. Eur. J. Oper. Res. (2006) 168(1):952–966Crossref, Google Scholar
• Bischoff E. E., Ratcliff M. S. W. Issues in the development of approaches to container loading. Omega (1995) 23(4):377–390Crossref, Google Scholar
• Bortfeldt A., Mack D. A heuristic for the three-dimensional strip packing problem. Eur. J. Oper. Res. (2007) 183(3):1267–1279Crossref, Google Scholar
• Bournez O., Maler O., Pnueli A., Vaandrager F. W., van Schuppen J. H. Orthogonal polyhedra: Representation and computation. Hybrid Systems: Comput. Control (HSCC) (1999) 1569(Springer, Berlin) 46–60Lecture Notes in Computer ScienceCrossref, Google Scholar
• Burke E. K., Kendall G., Whitwell G. A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. (2004) 52(4):655–671Link, Google Scholar
• Burke E. K., Kendall G., Whitwell G. A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. INFORMS J. Comput. (2009) 21(3):505–516Link, Google Scholar
• Crainic T. G., Perboli G., Tadei R. Extreme point-based heuristics for three-dimensional bin packing. INFORMS J. Comput. (2008) 20(3):368–384Link, Google Scholar
• de Berg M., Cheong O., van Kreveld M., Overmars M.Computational Geometry: Algorithms and Applications (2008) 3rd ed.(Springer, Berlin) Crossref, Google Scholar
• Dyson R. G., Gregory A. S. The cutting stock problem in the flat glass industry. Oper. Res. Quart. (1974) 25(1):41–53Crossref, Google Scholar
• Egeblad J., Pisinger D. Heuristic approaches for the two- and three-dimensional knapsack packing problem. Comput. Oper. Res. (2009) 36(4):1026–1049Crossref, Google Scholar
• Fasano G., Ciriani T. A., Gliozzi S., Johnson E. L., Tadei R. Cargo analytical integration in space engineering: A three-dimensional packing model. Operational Research in Industry (1999) (Purdue University Press, West Lafayette, IN) 232–246Crossref, Google Scholar
• Fasano G. A MIP approach for some practical packing problems: Balancing constraints and tetris-like items. 4OR (2004) 2(2):161–174Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, San Francisco) Google Scholar
• He K., Huang W. An efficient placement heuristic for three-dimensional rectangular packing. Comput. Oper. Res. (2011) 38(1):227–233Crossref, Google Scholar
• Hopper E., Turton B. C. H. A genetic algorithm for a 2D industrial packing problem. Comput. Indust. Engrg. (1999) 37(1–2):375–378Crossref, Google Scholar
• Karabulut K., Inceoglu M. M., Yakhno T. M. A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. Advances Inform. Systems (ADVIS 2004). (2004) 3261(Springer, Berlin) 441–450Lecture Notes in Computer ScienceCrossref, Google Scholar
• Larsen O., Mikkelsen G. An interactive system for the loading of cargo aircraft. Eur. J. Oper. Res. (1980) 4(6):367–373Crossref, Google Scholar
• Martello S., Pisinger D., Vigo D. The three-dimensional bin packing problem. Oper. Res. (2000) 48(2):256–267Link, Google Scholar
• Mukherjee I., Ray P. K. A review of optimization techniques in metal cutting processes. Comput. Indust. Engrg. (2006) 50(1–2):15–34Crossref, Google Scholar
• Padberg M. Packing small boxes into a big box. Math. Methods Oper. Res. (2000) 52(1):1–21Crossref, Google Scholar
• Riff M. C., Bonnaire X., Neveu B. A revision of recent approaches for two-dimensional strip-packing problems. Engrg. Appl. Artificial Intelligence (2009) 22(4–5):823–827Crossref, Google Scholar
• Walsh P.Advanced 3-D Game Programming Using DirectX 8.0 (2002) (Wordware Publishing, Plano, TX) Google Scholar
• Wäscher G., Haußner H., Schumann H. An improved typology of cutting and packing problems. Eur. J. Oper. Res. (2007) 183(3):1109–1130Crossref, Google Scholar
• Widmayer P., Wood D. A time- and space-optimal algorithm for Boolean mask operations for orthogonal polygons. Comput. Vision, Graphics, Image Processing (1988) 41(1):14–27Google Scholar
• Yaglom A. M., Yaglom I. M.Challenging Mathematical Problems with Elementary Solutions (1987) (Dover Publications, New York) Google Scholar