{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T07:20:12Z","timestamp":1711696812996},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,20]],"date-time":"2015-08-20T00:00:00Z","timestamp":1440028800000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10589-015-9780-2","type":"journal-article","created":{"date-parts":[[2015,8,19]],"date-time":"2015-08-19T07:20:27Z","timestamp":1439968827000},"page":"585-612","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A fast implementation for the 2D\/3D box placement problem"],"prefix":"10.1007","volume":"63","author":[{"given":"Wenbin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixing","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee-Chong","family":"Oon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,20]]},"reference":[{"issue":"5","key":"9780_CR1","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/TC.2007.1028","volume":"56","author":"A Ahmadinia","year":"2007","unstructured":"Ahmadinia, A., Bobda, C., Fekete, S., Teich, J., van der Veen, J.C.: Optimal free-space management and routing-conscious dynamic placement for reconfigurable devices. IEEE Trans. Comput. 56(5), 673\u2013680 (2007). doi: 10.1109\/TC.2007.1028","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"9780_CR2","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1080\/002075499191166","volume":"37","author":"AR Babu","year":"1999","unstructured":"Babu, A.R., Babu, N.R.: Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Int. J. Prod. Res. 37(7), 1625\u20131643 (1999). doi: 10.1080\/002075499191166","journal-title":"Int. J. Prod. Res."},{"key":"9780_CR3","doi-asserted-by":"crossref","unstructured":"Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846\u2013855 (1980). http:\/\/scitation.aip.org\/getabs\/servlet\/GetabsServlet?prog=normal&id=SMJCAT000009000004000846000001&idtype=cvips&gifs=yes","DOI":"10.1137\/0209064"},{"issue":"2","key":"9780_CR4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10732-008-9095-x","volume":"16","author":"J Bennell","year":"2010","unstructured":"Bennell, J., Song, X.: A beam search implementation for the irregular shape packing problem. J. Heuristics 16(2), 167\u2013188 (2010). doi: 10.1007\/s10732-008-9095-x","journal-title":"J. Heuristics"},{"issue":"4\u2013Part\u20131","key":"9780_CR5","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1287\/opre.1090.0770","volume":"58","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hellier, R.S.R., Kendall, G., Whitwell, G.: Irregular packing using the line and arc no-fit polygon. Oper. Res. 58(4\u2013Part\u20131), 948\u2013970 (2010). doi: 10.1287\/opre.1090.0770","journal-title":"Oper. Res."},{"key":"9780_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: A (slightly) faster algorithm for Klee\u2019s measure problem. Comput. Geom. (2009). doi: 10.1016\/j.comgeo.2009.01.007","DOI":"10.1016\/j.comgeo.2009.01.007"},{"issue":"8","key":"9780_CR7","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"C\u201332","author":"B Chazelle","year":"1983","unstructured":"Chazelle, B.: The bottomn-left bin-packing heuristic: an efficient implementation. IEEE Trans. Comput. C\u201332(8), 697\u2013707 (1983). doi: 10.1109\/TC.1983.1676307","journal-title":"IEEE Trans. Comput."},{"key":"9780_CR8","doi-asserted-by":"crossref","unstructured":"Chlebus, B.: On the Klee\u2019s measure problem in small dimensions. In: Rovan, B. (ed.) SOFSEM\u201998: Theory and Practice of Informatics. Lecture Notes in Computer Science, vol. 1521, Chap.\u00a022, pp. 304\u2013311. Springer, Berlin (1998). doi: 10.1007\/3-540-49477-4_22","DOI":"10.1007\/3-540-49477-4_22"},{"key":"9780_CR9","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). http:\/\/www.worldcat.org\/isbn\/3540779736","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"3","key":"9780_CR10","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"40","author":"M Gendreau","year":"2006","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A Tabu search algorithm for a routing and container loading problem. Transp. Sci. 40(3), 342\u2013350 (2006). doi: 10.1287\/trsc.1050.0145","journal-title":"Transp. Sci."},{"key":"9780_CR11","doi-asserted-by":"crossref","unstructured":"Healy, P., Creavin, M., Kuusik, A.: An optimal algorithm for rectangle placement. Oper. Res. Lett. 24(1\u20132), 73\u201380 (1999). doi: 10.1016\/S0167-6377(98)00048-0 , http:\/\/www.sciencedirect.com\/science\/article\/B6V8M-43GHSPF-B\/2\/42b6ea739a362592dccfb090350a5a34","DOI":"10.1016\/S0167-6377(98)00048-0"},{"issue":"1","key":"9780_CR12","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.C.H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128(1), 34\u201357 (2001). doi: 10.1016\/s0377-2217(99)00357-4","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9780_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1), 165\u2013181 (1996). doi: 10.1016\/0377-2217(94)00166-9","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9780_CR14","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0220065","volume":"20","author":"MH Overmars","year":"1991","unstructured":"Overmars, M.H., Yap, C.K.: New upper bounds in Klee\u2019s measure problem. SIAM J. Comput. 20(6), 1034\u20131045 (1991). doi: 10.1137\/0220065","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9780_CR15","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0196-6774(81)90027-4","volume":"2","author":"J Vanleeuwen","year":"1981","unstructured":"Vanleeuwen, J., Wood, D.: The measure problem for rectangular ranges in d-space. J. Algorithm. 2(3), 282\u2013300 (1981). doi: 10.1016\/0196-6774(81)90027-4","journal-title":"J. Algorithm."},{"issue":"2","key":"9780_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0377-2217(02)00129-7","volume":"141","author":"Y Wu","year":"2002","unstructured":"Wu, Y.: An effective quasi-human based heuristic for solving the rectangle packing problem. Eur. J. Oper. Res. 141(2), 341\u2013358 (2002). doi: 10.1016\/S0377-2217(02)00129-7","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9780_CR17","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2012.04.036","volume":"222","author":"W Zhu","year":"2012","unstructured":"Zhu, W., Lim, A.: A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem. Eur. J. Oper. Res. 222(3), 408\u2013417 (2012). doi: 10.1016\/j.ejor.2012.04.036","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9780_CR18","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10489-012-0337-0","volume":"37","author":"W Zhu","year":"2012","unstructured":"Zhu, W., Oon, W.C., Lim, A., Weng, Y.: The six elements to block-building approaches for the single container loading problem. Appl. Intell. 37(3), 431\u2013445 (2012). doi: 10.1007\/s10489-012-0337-0","journal-title":"Appl. Intell."},{"issue":"9","key":"9780_CR19","first-page":"191","volume":"39","author":"W Zhu","year":"2012","unstructured":"Zhu, W., Qin, H., Lim, A., Wang, L.: A two-stage Tabu Search Algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. Comput. Oper. Res. 39(9), 191\u2013199 (2012). doi: 10.1016\/j.cor.2011.11.001","journal-title":"Comput. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9780-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9780-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9780-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:37:40Z","timestamp":1559227060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9780-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,20]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9780"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9780-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,20]]}}}