{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:03:17Z","timestamp":1774594997670,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T00:00:00Z","timestamp":1448323200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10479-015-2048-5","type":"journal-article","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T12:33:35Z","timestamp":1448368415000},"page":"397-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A three-dimensional bin-packing model: exact multicriteria solution and computational complexity"],"prefix":"10.1007","volume":"251","author":[{"given":"Gregory S.","family":"Taylor","sequence":"first","affiliation":[]},{"given":"Yupo","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Ghulam","family":"Rasool","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,24]]},"reference":[{"key":"2048_CR1","unstructured":"Ballew, B.P. (2000). The distributor\u2019s three-dimensional pallet-packing problem: A mathematical formulation and heuristic solution approach. Master of Science thesis, Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, OH."},{"issue":"1","key":"2048_CR2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1061\/(ASCE)0733-9488(1992)118:1(24)","volume":"118","author":"S Benabdallah","year":"1992","unstructured":"Benabdallah, S., & Wright, J. R. (1992). Multiple subregions allocation models. Journal of Urban Planning and Development, 118(1), 24\u201340.","journal-title":"Journal of Urban Planning and Development"},{"issue":"952","key":"2048_CR3","first-page":"966","volume":"168","author":"EE Bischoff","year":"2006","unstructured":"Bischoff, E. E. (2006). Three-dimensional packing of iten1s with limited load bearing strength. European Journal of Operational Research, 168(952), 966.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"2048_CR4","first-page":"401","volume":"4","author":"HG Bortfeldt","year":"1997","unstructured":"Bortfeldt, H. G. (1997). A generic algorithm for solving the container loading problem. International Transactions of Operational Research, 4(5), 401\u2013418.","journal-title":"International Transactions of Operational Research"},{"key":"2048_CR5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0305-0548(03)00244-2","volume":"32","author":"J-M Bourjolly","year":"2005","unstructured":"Bourjolly, J.-M., & Rebetez, V. (2005). An analysis of lower bound procedures for the bin packing problem. Computers and Operations Research, 32, 395\u2013405.","journal-title":"Computers and Operations Research"},{"key":"2048_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9309-2","volume-title":"The logic of logistics","author":"J Bramel","year":"1997","unstructured":"Bramel, J., & Simchi-Levi, D. (1997). The logic of logistics. New York: Springer."},{"key":"2048_CR7","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1016\/j.cor.2005.08.012","volume":"34","author":"J Carlier","year":"2007","unstructured":"Carlier, J., Clautiaux, F., & Moukrim, A. (2007). New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers and Operations Research, 34, 2223\u20132250.","journal-title":"Computers and Operations Research"},{"key":"2048_CR8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.tcs.2008.07.027","volume":"409","author":"M Cieliebak","year":"2008","unstructured":"Cieliebak, M., Hall, A., & Jacob, R. (2008). Sequential vector packing. Theoretical Computer Science, 409, 351\u2013363.","journal-title":"Theoretical Computer Science"},{"issue":"10","key":"2048_CR9","first-page":"193","volume":"29","author":"CS Chen","year":"1991","unstructured":"Chen, C. S., Sarin, S., & Ram, B. (1991). The pallet packing problem for non-uniform box sizes. International Journal of Production Research, 29(10), 193\u20131968.","journal-title":"International Journal of Production Research"},{"key":"2048_CR10","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1016\/j.ejor.2005.12.048","volume":"183","author":"F Clautiaux","year":"2007","unstructured":"Clautiaux, F., Carlier, J., & Moukrim, A. (2007). A new exact method for the two-dimensional orthogonal packing problem. European Journal of Operational Research, 183, 1196\u20131211.","journal-title":"European Journal of Operational Research"},{"key":"2048_CR11","first-page":"91","volume-title":"New Technologies\u2014Trends, innovations and research","author":"TG Crainic","year":"2012","unstructured":"Crainic, T. G., Perboli, G., & Tadei, R. (2012). Recent advances in multi-dimensional packing $$\\sim $$ \u223c problems. In C. Volosencu (Ed.), New Technologies\u2014Trends, innovations and research (pp. 91\u2013110). New York: InTech."},{"key":"2048_CR12","doi-asserted-by":"crossref","first-page":"3439","DOI":"10.1016\/j.cor.2006.02.007","volume":"34","author":"TG Crainic","year":"2007","unstructured":"Crainic, T. G., Perbolic, G., Pezzuto, M., & Tadei, R. (2007). New bin packing fast lower bounds. Computers and Operations Research, 34, 3439\u20133457.","journal-title":"Computers and Operations Research"},{"key":"2048_CR13","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JMV Carvalho de","year":"1999","unstructured":"de Carvalho, J. M. V. (1999). Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research, 86, 629\u2013659.","journal-title":"Annals of Operations Research"},{"key":"2048_CR14","unstructured":"Degraeve, Z., Peeters, M. (1998). Benchmark results for the cutting stock and bin packing problem working paper. Department of Applied Economics, Katholiecke Unversiteit Leuven, Leuven, Belgium."},{"issue":"4","key":"2048_CR15","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/opre.1050.0210","volume":"53","author":"E Boef den","year":"2005","unstructured":"den Boef, E., Korst, J., Martello, S., Pisinger, D., & Vigo, D. (2005). Erratum to the three-dimensional bin packing problem: Robot-packable and orthogonal variants of packing problems. Operations Research, 53(4), 735\u2013736.","journal-title":"Operations Research"},{"key":"2048_CR16","unstructured":"Department of Defense - DOD. (1987). Military standard dod requirements for a logistic support analysis record MIL-STD-1388-2A, Washington, D.C."},{"key":"2048_CR17","unstructured":"Department of the Air Force - AF. (1989). Contingency operation\/mobility planning and execution system (COMPES) cargo movement operations system (CMOS) computer aided load manifesting (CALM): A200B\/AU.AFB28-346, I\/II, Washington, D.C."},{"issue":"1","key":"2048_CR18","first-page":"1","volume":"13","author":"WB Dowsland","year":"1985","unstructured":"Dowsland, W. B. (1985). Two and tree dimension packing problems and solution methods. New Zealand Operational Research, 13(1), 1\u201318.","journal-title":"New Zealand Operational Research"},{"key":"2048_CR19","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0377-2217(87)90140-8","volume":"31","author":"KA Dowsland","year":"1987","unstructured":"Dowsland, K. A. (1987). An exact algorithm for the pallet loading problem. European Journal of Operational Research, 31, 78\u201383.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"2048_CR20","doi-asserted-by":"crossref","first-page":"1673","DOI":"10.1080\/00207549108948039","volume":"29","author":"WB Dowsland","year":"1991","unstructured":"Dowsland, W. B. (1991). Three-dimensional packing-solution approaches and heuristic development. International Journal of Production Research, 29(8), 1673\u20131685.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"2048_CR21","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1287\/opre.45.4.596","volume":"45","author":"A Federgruen","year":"1997","unstructured":"Federgruen, A., & Van Ryzin, G. (1997). Probabilistic analysis of a generalized bin packing problem and applications. Operations Research, 45(4), 596\u2013609.","journal-title":"Operations Research"},{"key":"2048_CR22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S Fekete","year":"2001","unstructured":"Fekete, S., & Schepers, J. (2001). New classes of fast lower bounds for bin packing problems. Mathematical Programming, 91, 11\u201331.","journal-title":"Mathematical Programming"},{"issue":"3","key":"2048_CR23","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete, S. P., Schepers, J., & van der Veen, J. C. (2007). An exact algorithm for higher-dimensional orthogonal packing. Operations Research, 55(3), 569\u2013587.","journal-title":"Operations Research"},{"issue":"4","key":"2048_CR24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1057\/jors.1992.45","volume":"43","author":"JA George","year":"1992","unstructured":"George, J. A. (1992). A method for solving container packing for a single size of box. Journal of Operational Research Society, 43(4), 307\u2013312.","journal-title":"Journal of Operational Research Society"},{"key":"2048_CR25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","volume":"4","author":"H Gehring","year":"1997","unstructured":"Gehring, H., & Bortfeldt, A. (1997). A genetic algorithm for solving the container loading problem. International Transactions of Operational Research, 4, 401\u2013418.","journal-title":"International Transactions of Operational Research"},{"issue":"1","key":"2048_CR26","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore, P. C., & Gomory, R. E. (1965). Multistage cutting stock problems of two and more dimensions. Operations Research, 13(1), 94\u2013120.","journal-title":"Operations Research"},{"key":"2048_CR27","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1002\/(SICI)1520-6750(199812)45:8<751::AID-NAV1>3.0.CO;2-R","volume":"45","author":"KR Heidelberg","year":"1998","unstructured":"Heidelberg, K. R., Parnell, G. S., & Amers, J. E. (1998). Automated air load planning. Naval Research Logistics, 45, 751\u2013768.","journal-title":"Naval Research Logistics"},{"key":"2048_CR28","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF02125406","volume":"63","author":"EA Herbert","year":"1996","unstructured":"Herbert, E. A., & Dowsland, K. A. (1996). A family of genetic algorithms for the pallet loading problem. Annals of Operations Research, 63, 415\u2013436.","journal-title":"Annals of Operations Research"},{"key":"2048_CR29","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1111\/j.1475-3995.1998.tb00119.x","volume":"5","author":"M Hifi","year":"1998","unstructured":"Hifi, M., & Ouafi, R. (1998). A best-first branch-and-bound algorithm for orthogonal rectangular packing problems. International Transactions on Operational Research, 5, 345\u2013356.","journal-title":"International Transactions on Operational Research"},{"issue":"3","key":"2048_CR30","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/05695558208974601","volume":"14","author":"TJ Hodgson","year":"1982","unstructured":"Hodgson, T. J. (1982). A combined approach to the pallet loading problem. IIE Transactions, 14(3), 175\u2013182.","journal-title":"IIE Transactions"},{"key":"2048_CR31","unstructured":"Hodgson, T. J., Hughes, D. S., & Martin-Vega, L. A. (1983). A note on a combined approach to the pallet loading problem research report (83-7). Industrial and Systems Engineering Department, university of Florida, Gainsville, Florida, (AD-A125 887)."},{"key":"2048_CR32","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M Labbe","year":"1991","unstructured":"Labbe, M., Laporte, G., & Mercure, H. (1991). Capacitated vehicle routing on trees. Operations Research, 39, 616\u2013622.","journal-title":"Operations Research"},{"issue":"4","key":"2048_CR33","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., & Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11(4), 345\u2013357.","journal-title":"INFORMS Journal on Computing"},{"key":"2048_CR34","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28, 59\u201370.","journal-title":"Discrete Applied Mathematics"},{"key":"2048_CR35","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S Martello","year":"1998","unstructured":"Martello, S., & Vigo, D. (1998). Exact solution of the finite two dimensional bin packing problem. Management Science, 44, 388\u2013399.","journal-title":"Management Science"},{"issue":"2","key":"2048_CR36","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., & Vigo, D. (2000). The three-dimensional bin packing problem. Operations Research, 48(2), 256\u2013267.","journal-title":"Operations Research"},{"issue":"1","key":"2048_CR37","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1111\/1475-3995.d01-8","volume":"1","author":"R Morabitoc","year":"1994","unstructured":"Morabitoc, R., & Arenales, M. (1994). An and\/or-graph approach to the container loading problem. International Transactions of Operational Research, 1(1), 59\u201373.","journal-title":"International Transactions of Operational Research"},{"key":"2048_CR38","doi-asserted-by":"crossref","first-page":"2589","DOI":"10.1016\/j.cor.2005.10.001","volume":"34","author":"FK Miyazawa","year":"2007","unstructured":"Miyazawa, F. K., & Wakabayashi, Y. (2007). Two- and three-dimensional parametric packing. Computers and Operations Research, 34, 2589\u20132603.","journal-title":"Computers and Operations Research"},{"key":"2048_CR39","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02125404","volume":"63","author":"C Reeves","year":"1996","unstructured":"Reeves, C. (1996). Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63, 371\u2013396.","journal-title":"Annals of Operations Research"},{"key":"2048_CR40","volume-title":"Multiple criteria optimization: Theory, computation and application","author":"R Steuer","year":"1986","unstructured":"Steuer, R. (1986). Multiple criteria optimization: Theory, computation and application. Wiley: New Jersey."},{"issue":"1","key":"2048_CR41","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1111\/j.1475-3995.1998.tb00101.x","volume":"5","author":"YG Stoyan","year":"1998","unstructured":"Stoyan, Y. G., & Yaskov, G. N. (1998). Mathematical model and solution method of optimization problem of placement of rectangles and circle stacking into account special constraints. International Transactions of Operational Research, 5(1), 45\u201357.","journal-title":"International Transactions of Operational Research"},{"key":"2048_CR42","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G Wascher","year":"2007","unstructured":"Wascher, G., Hau\u00dfner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2048-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2048-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2048-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2048-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:10:05Z","timestamp":1559153405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2048-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,24]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["2048"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2048-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,24]]}}}