{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:53:00Z","timestamp":1649188380736},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T00:00:00Z","timestamp":1277251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10288-010-0133-9","type":"journal-article","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T15:00:30Z","timestamp":1277218830000},"page":"83-101","source":"Crossref","is-referenced-by-count":1,"title":["A fast heuristic for a three-dimensional non-convex domain loading problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Maurizio","family":"Boccia","sequence":"first","affiliation":[]},{"given":"Serena","family":"di Muro","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Mosca","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Sforza","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Sterle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,23]]},"reference":[{"key":"133_CR1","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/978-3-540-72845-0_32","volume":"4525","author":"E Althaus","year":"2007","unstructured":"Althaus E, Baumann T, Sch\u00f6mer E, Werth K (2007) Trunk packing revisited. Lect Notes Comput Sci 4525: 420\u2013432","journal-title":"Lect Notes Comput Sci"},{"issue":"4","key":"133_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"EE Bischoff","year":"1995","unstructured":"Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega Int J Manag Sci 23(4): 377\u2013390","journal-title":"Omega Int J Manag Sci"},{"issue":"3","key":"133_CR3","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1016\/j.ejor.2004.04.037","volume":"168","author":"EE Bischoff","year":"2006","unstructured":"Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168(3): 952\u2013966","journal-title":"Eur J Oper Res"},{"key":"133_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s002910050071","volume":"20","author":"A Bortfeldt","year":"1998","unstructured":"Bortfeldt A, Gehring H (1998) A tabu search algorithm for weakly heterogeneous container loading problems. OR Spectr 20: 237\u2013250","journal-title":"OR Spectr"},{"issue":"1","key":"133_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt A, Gehring H (2001) A hybrid genetic algorithm for the container loading problem. Eur J Oper Res 131(1): 143\u2013161","journal-title":"Eur J Oper Res"},{"issue":"4","key":"133_CR6","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0167-8191(03)00047-4","volume":"29","author":"A Bortfeldt","year":"2003","unstructured":"Bortfeldt A, Gehring H, Mack D (2003) A parallel tabu search algorithm for solving the container loading problem. Parallel Comput 29(4): 641\u2013662","journal-title":"Parallel Comput"},{"issue":"1","key":"133_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(94)00002-T","volume":"80","author":"CS Chen","year":"1995","unstructured":"Chen CS, Lee SM, Shen QS (1995) An analytical model for the container loading problem. Eur J Oper Res 80(1): 68\u201376","journal-title":"Eur J Oper Res"},{"issue":"3","key":"133_CR8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(98)00139-8","volume":"114","author":"AP Davies","year":"1999","unstructured":"Davies AP, Bischoff EE (1999) Weight distribution considerations in container loading. Eur J Oper Res 114(3): 509\u2013527","journal-title":"Eur J Oper Res"},{"issue":"2","key":"133_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dychoff","year":"1990","unstructured":"Dychoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44(2): 145\u2013159","journal-title":"Eur J Oper Res"},{"key":"133_CR10","volume-title":"Annotated bibliographies in combinatorial optimization","author":"H Dyckhoff","year":"1997","unstructured":"Dyckhoff H, Scheithauer G, Terno J (1997) Cutting and packing (C&P). In: Dell\u2019Amico M, Maffioli F, Martello S (eds) Annotated bibliographies in combinatorial optimization. Wiley, Chichester"},{"key":"133_CR11","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1016\/j.cor.2007.12.004","volume":"36","author":"J Egeblad","year":"2009","unstructured":"Egeblad J, Pisinger D (2009) Heuristic approaches for the two and three-dimensional knapsack packing problem. Comput Oper Res 36: 1026\u20131049","journal-title":"Comput Oper Res"},{"key":"133_CR12","first-page":"618","volume-title":"ESA 2003, vol 2832. LNCS","author":"F Eisenbrand","year":"2003","unstructured":"Eisenbrand F, Funke S, Reichel J, Sch\u00f6mer E (2003) Packing a trunk. In: Di Battista G, Zwick U (eds) ESA 2003, vol 2832. LNCS. Springer, Heidelberg, pp 618\u2013629"},{"key":"133_CR13","unstructured":"Eisenbrand F, Funke S, Karrenbauer A, Reichel J, Sch\u00f6mer E (2005) Packing a trunk: now with a twist! In: SPM 05: proceedings of the 2005 ACM symposium on solid and physical modeling. ACM Press, New York, pp 197\u2013206"},{"issue":"2","key":"133_CR14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(02)00133-9","volume":"141","author":"M Eley","year":"2002","unstructured":"Eley M (2002) Solving container loading problems by block arrangement. Eur J Oper Res 141(2): 393\u2013409","journal-title":"Eur J Oper Res"},{"key":"133_CR15","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1057\/9780230372924_11","volume-title":"Operations research in industry","author":"G Fasano","year":"1999","unstructured":"Fasano G (1999) Cargo analytical integration in space engineering: a three dimensional packing model. In: Ciriani T, Gliozzi S, Johnson EL (eds) Operations research in industry. Macmillan, New York, pp 232\u2013246"},{"key":"133_CR16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-1-4757-3752-3_4","volume-title":"Operations research in space and air","author":"G Fasano","year":"2003","unstructured":"Fasano G (2003) MIP models for solving three-dimensional packing problems arising in space engineering. In: Ciriani T, Fasano G, Gliozzi S, Johnson EL (eds) Operations research in space and air. Kluwer, Boston, pp 43\u201356"},{"issue":"2","key":"133_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10288-004-0037-7","volume":"2","author":"G Fasano","year":"2004","unstructured":"Fasano G (2004) A MIP approach for some practical packing problems: balancing constraints and tetris like items. 4OR 2(2): 161\u2013174","journal-title":"4OR"},{"issue":"3","key":"133_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10288-007-0049-1","volume":"6","author":"G Fasano","year":"2008","unstructured":"Fasano G (2008) MIP-based heuristic for non-standard 3D-packing problems. 4OR 6(3): 291\u2013310","journal-title":"4OR"},{"issue":"2","key":"133_CR19","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"S Fekete","year":"2004","unstructured":"Fekete S, Schepers J (2004) A combinatorial characterization of higher-dimensional orthogonal packing. Math Oper Res 29(2): 353\u2013368","journal-title":"Math Oper Res"},{"key":"133_CR20","doi-asserted-by":"crossref","unstructured":"Fekete S, Schepers J (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res (in press)","DOI":"10.1287\/opre.1060.0369"},{"key":"133_CR21","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. Int Trans Oper Res 4: 401\u2013418","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"133_CR22","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1111\/1475-3995.00369","volume":"9","author":"H Gehring","year":"2002","unstructured":"Gehring H, Bortfeldt A (2002) A parallel genetic algorithm for solving the container loading problem. Int Trans Oper Res 9(4): 497\u2013511","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"133_CR23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","volume":"7","author":"JA George","year":"1980","unstructured":"George JA, Robinson DF (1980) A heuristic for packing boxes into a container. Comput Oper Res 7(3): 147\u2013156","journal-title":"Comput Oper Res"},{"issue":"4","key":"133_CR24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1057\/jors.1992.45","volume":"43","author":"JA George","year":"1992","unstructured":"George JA (1992) A method for solving container packing for a single size of box. J Oper Res Soc 43(4): 307\u2013312","journal-title":"J Oper Res Soc"},{"issue":"2","key":"133_CR25","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.cor.2007.09.008","volume":"36","author":"W Huang","year":"2009","unstructured":"Huang W, He K (2009) A new heuristic algorithm for cuboids packing with no orientation constraints. Comput Oper Res 36(2): 425\u2013432","journal-title":"Comput Oper Res"},{"key":"133_CR26","doi-asserted-by":"crossref","unstructured":"Martello S, Pisinger D, Vigo D, den Boef E, Korst J (2007) Algorithms for general and robot-packable variants of the three-dimensional bin packing problem. ACM Trans Math Softw 33(1): article 7","DOI":"10.1145\/1206040.1206047"},{"key":"133_CR27","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2005.57","volume":"20","author":"A Moura","year":"2005","unstructured":"Moura A, Oliveira JF (2005) A GRASP approach to the container-loading problem. IEEE Intell Syst 20: 50\u201357","journal-title":"IEEE Intell Syst"},{"key":"133_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s001860000066","volume":"52","author":"M Padberg","year":"2000","unstructured":"Padberg M (2000) Packing small boxes into a big box. Math Methods Oper Res 52: 1\u201321","journal-title":"Math Methods Oper Res"},{"issue":"3","key":"133_CR29","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/ijoc.1070.0254","volume":"20","author":"F Parre\u00f1o","year":"2008","unstructured":"Parre\u00f1o F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2008a) A maximal-space algorithm for the container loading problem. INFORMS J Comput 20(3): 412\u2013422","journal-title":"INFORMS J Comput"},{"key":"133_CR30","doi-asserted-by":"crossref","unstructured":"Parre\u00f1o F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2008b) Neighborhood structures for the container loading problem: a VNS implementation. J Heuristics. doi: 10.1007\/s10732-008-9081-3","DOI":"10.1007\/s10732-008-9081-3"},{"issue":"2","key":"133_CR31","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D Pisinger","year":"2002","unstructured":"Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141(2): 382\u2013392","journal-title":"Eur J Oper Res"},{"issue":"3","key":"133_CR32","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/s10559-005-0067-y","volume":"41","author":"G Scheithauer","year":"2005","unstructured":"Scheithauer G, Stoyan YG, Romanova T (2005) Mathematical modeling of interactions of primary 3D objects. Cybern Syst Anal 41(3): 332\u2013342","journal-title":"Cybern Syst Anal"},{"key":"133_CR33","unstructured":"Stoyan YG (1980) On one generalization of the dense allocation function. In: Reports Ukrainian SSR Academy of Science Series A, vol 8. pp 70\u201374"},{"key":"133_CR34","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0377-2217(95)00038-0","volume":"92","author":"YG Stoyan","year":"1996","unstructured":"Stoyan YG, Novozhilova MV, Kartashov KV (1996) Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem. Eur J Oper Res 92: 193\u2013210","journal-title":"Eur J Oper Res"},{"key":"133_CR35","first-page":"69","volume":"2","author":"Y Stoyan","year":"2004","unstructured":"Stoyan Y, Scheithauer G, Gil N, Romanova T (2004) \u03a6-functions for complex 2D-objects. 4OR 2: 69\u201384","journal-title":"4OR"},{"issue":"1","key":"133_CR36","first-page":"1","volume":"2","author":"Y Stoyan","year":"2002","unstructured":"Stoyan Y, Terno J, Scheithauer G, Gil N, Romanova T (2002) \u03a6-functions for primary 2D-objects. Studia Inform Univ 2(1): 1\u201332","journal-title":"Studia Inform Univ"},{"issue":"2","key":"133_CR37","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/S0377-2217(99)00263-5","volume":"123","author":"J Terno","year":"2000","unstructured":"Terno J, Scheithauer G, Sommerweiss U, Riehme J (2000) An efficient approach for the multi-pallet loading problem. Eur J Oper Res 123(2): 372\u2013381","journal-title":"Eur J Oper Res"},{"issue":"1","key":"133_CR38","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2007.08.017","volume":"191","author":"Z Wang","year":"2008","unstructured":"Wang Z, Kevin WL, Zhang X (2008) A heuristic for the container loading problem: a tertiary-tree-based dynamic space decomposition approach. Eur J Oper Res 191(1): 86\u201399","journal-title":"Eur J Oper Res"},{"issue":"3","key":"133_CR39","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3): 1109\u20131130","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0133-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-010-0133-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0133-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:18:02Z","timestamp":1559207882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-010-0133-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,23]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s10288-010-0133-9","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,23]]}}}