{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T21:54:34Z","timestamp":1759701274321},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T00:00:00Z","timestamp":1426291200000},"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":["J Math Model Algor"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10852-015-9278-z","type":"journal-article","created":{"date-parts":[[2015,3,13]],"date-time":"2015-03-13T17:51:47Z","timestamp":1426269107000},"page":"343-361","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Search Procedure for the Two-dimensional Orthogonal Packing Problem"],"prefix":"10.1007","volume":"14","author":[{"given":"S.","family":"Grandcolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Pinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,14]]},"reference":[{"issue":"4","key":"9278_CR1","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.: Reactive grasp for the strip-packing problem. Comput.Oper. Res. 35(4), 1065\u20131083 (2008). doi: 10.1016\/j.cor.2006.07.004","journal-title":"Comput.Oper. Res."},{"key":"9278_CR2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00291-008-0128-5","volume":"31","author":"R Alvarez-Valdes","year":"2009","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.: A branch and bound algorithm for the strip packing problem. OR Spectr. 31, 431\u2013459 (2009)","journal-title":"OR Spectr."},{"key":"9278_CR3","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1287\/opre.1100.0833","volume":"58","author":"MA Boschetti","year":"2010","unstructured":"Boschetti, M.A., Montaletti, L.: An exact algorithm for the two-dimensional strip-packing problem. Oper. Res. 58, 1774\u20131791 (2010)","journal-title":"Oper. Res."},{"issue":"3","key":"9278_CR4","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.: A new exact method for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3), 1196\u20131211 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9278_CR5","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.cor.2006.05.012","volume":"35","author":"F Clautiaux","year":"2008","unstructured":"Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35, 944\u2013959 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9278_CR6","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/opre.2013.1248","volume":"62","author":"JF C\u00f4t\u00e9","year":"2014","unstructured":"C\u00f4t\u00e9, J.F., Dell\u2019Amico, M., Iori, M.: Combinatorial benders\u2019 cuts for the strip packing problem. Oper. Res. 62(3), 643\u2013661 (2014)","journal-title":"Oper. Res."},{"issue":"12","key":"9278_CR7","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E Demeulemeester","year":"1992","unstructured":"Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manage. Sci. 38(12), 1803\u20131818 (1992)","journal-title":"Manage. Sci."},{"issue":"2","key":"9278_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete, S.P., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Math. Oper. Res. 29(2), 353\u2013368 (2004)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9278_CR9","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.: An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55(3), 569\u2013587 (2007)","journal-title":"Oper. Res."},{"key":"9278_CR10","doi-asserted-by":"crossref","unstructured":"Grandcolas, S., Pinto, C.: A sat encoding for multi-dimensional packing problems. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 6140, pp. 141\u2013146 (2010)","DOI":"10.1007\/978-3-642-13520-0_18"},{"key":"9278_CR11","first-page":"462","volume":"16","author":"JC Herz","year":"1972","unstructured":"Herz, J.C.: Recursive computational procedure for the two dimensional stock cutting. IBM. J. Res. Dev. 16, 462\u2013469 (1972)","journal-title":"J. Res. Dev."},{"key":"9278_CR12","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E Hopper","year":"2000","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, 34\u201357 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9278_CR13","first-page":"47","volume":"46","author":"E Huang","year":"2013","unstructured":"Huang, E., Korf, R.E.: Optimal rectangle packing: An absolute placement approach. J. Artif. Int. Res. 46(1), 47\u201387 (2013)","journal-title":"J. Artif. Int. Res."},{"issue":"1","key":"9278_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10852-011-9159-z","volume":"11","author":"C Joncour","year":"2012","unstructured":"Joncour, C., P\u00eacher, A., Valicov, P.: Mpq-trees for the orthogonal packing problem. J. Math. Model. Algorithms 11(1), 3\u201322 (2012)","journal-title":"J. Math. Model. Algorithms"},{"key":"9278_CR15","doi-asserted-by":"crossref","unstructured":"Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., Nagamochi, H.: Exact algorithms for the 2-dimensional strip packing problem with and without rotations (2008)","DOI":"10.1016\/j.ejor.2008.08.020"},{"issue":"3","key":"9278_CR16","first-page":"310","volume":"15","author":"S Martello","year":"2003","unstructured":"Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. J. Comput. 15(3), 310\u2013319 (2003)","journal-title":"J. Comput."},{"issue":"2","key":"9278_CR17","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.: The three-dimensional bin packing problem. Oper. Res. 48(2), 256\u2013267 (2000)","journal-title":"Oper. Res."},{"key":"9278_CR18","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1080\/05695557808975212","volume":"10","author":"J Stinson","year":"1978","unstructured":"Stinson, J., Davis, E., Khumawala, B.: Multiple resource-constrained scheduling using branch and bound. AIIE Trans. 10, 252\u2013259 (1978)","journal-title":"AIIE Trans."}],"container-title":["Journal of Mathematical Modelling and Algorithms in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-015-9278-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-015-9278-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-015-9278-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T16:00:18Z","timestamp":1651507218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-015-9278-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,14]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9278"],"URL":"https:\/\/doi.org\/10.1007\/s10852-015-9278-z","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,14]]}}}