{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:40Z","timestamp":1725552340886},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_26","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"302-313","source":"Crossref","is-referenced-by-count":0,"title":["New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint"],"prefix":"10.1007","author":[{"given":"Minh Hoang","family":"Ha","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Clautiaux","sequence":"additional","affiliation":[]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Wilbaut","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E.: Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society\u00a036, 297\u2013306 (1985)","journal-title":"Journal of the Operational Research Society"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J.E. Beasley","year":"1985","unstructured":"Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research\u00a033, 49\u201364 (1985)","journal-title":"Operations Research"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","volume":"25","author":"B.E. Bengtsson","year":"1982","unstructured":"Bengtsson, B.E.: Packing rectangular pieces - a heuristic approach. The computer journal\u00a025, 353\u2013357 (1982)","journal-title":"The computer journal"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A. Bortfeldt","year":"2006","unstructured":"Bortfeldt, A.: A genetic algorithm for the two dimensional strip packing problem. European Journal of Operational Research\u00a0172, 814\u2013837 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Operations Research\u00a052(4), 655\u2013671 (2004)","journal-title":"Operations Research"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N. Christofides","year":"1977","unstructured":"Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Operations Research\u00a025, 30\u201344 (1977)","journal-title":"Operations Research"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.orl.2006.07.001","volume":"35","author":"F. Clautiaux","year":"2007","unstructured":"Clautiaux, F., Jouglet, A., El Hayek, J.: A new lower bound for the non-oriented two-dimensional bin-packing problem. Operations Research Letters\u00a035(3), 365\u2013373 (2007)","journal-title":"Operations Research Letters"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-68552-4_4","volume-title":"Experimental Algorithms","author":"F. Clautiaux","year":"2008","unstructured":"Clautiaux, F., Jouglet, A., Moukrim, A.: A new graph-theoretical model for k-dimensional guillotine-cutting problems. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 43\u201354. Springer, Heidelberg (2008)"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E. Coffman","year":"1980","unstructured":"Coffman, E., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing\u00a09(4), 808\u2013826 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR10","doi-asserted-by":"publisher","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 on metaheuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research\u00a0128, 34\u201357 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"26_CR11","first-page":"123","volume":"2","author":"E. Hopper","year":"2002","unstructured":"Hopper, E., Turton, B.C.H.: Problem generators for rectangular packing problems. Studia Informatica Universalis\u00a02(1), 123\u2013136 (2002)","journal-title":"Studia Informatica Universalis"},{"key":"26_CR12","volume-title":"Applied Optimization, ch.\u00a07","author":"M. Iori","year":"2003","unstructured":"Iori, M., Martello, S., Monaci, M.: Metaheuristic algorithms for the strip packing problem. In: Applied Optimization, ch.\u00a07, vol.\u00a078. Springer, Heidelberg (2003)"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2008.08.020","volume":"198","author":"M. Kenmochi","year":"2009","unstructured":"Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., Nagamochi, H.: Exact algorithms for the two-dimensional strip packing problem with and without rotations. European Journal of Operational Research\u00a0198(1), 73\u201383 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"26_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A. Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two dimensional bin packing problem. INFORMS Journal on Computing\u00a011(4), 345\u2013357 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Lodi, A., Martello, S., Vigo, D.: Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. In: MIC 1997: 2nd meta-heuristics international conference, pp. 125\u2013139 (1999)","DOI":"10.1007\/978-1-4615-5775-3_9"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Mumford-Valenzuela, C., Vick, J., Wang, P.Y.: Heuristics for large strip packing problems with guillotine patterns: an empirical study, pp. 501\u2013522 (2004)","DOI":"10.1007\/978-1-4757-4137-7_24"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.disopt.2008.11.002","volume":"6","author":"N. Ntene","year":"2009","unstructured":"Ntene, N., van Vuuren, J.H.: A survey and comparison of guillotine heuristics for the 2d oriented offline strip packing problem. Discrete Optimization\u00a06(2), 174\u2013188 (2009)","journal-title":"Discrete Optimization"},{"issue":"3","key":"26_CR18","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., Stutzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research\u00a0177(3), 2033\u20132049 (2007)","journal-title":"European Journal of Operational Research"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics\u00a0159, 139\u2013171 (2000)","journal-title":"Journal of Computational Physics"},{"key":"26_CR20","unstructured":"Waescher, G., Haussner, H., Schumann, H.: An improved typology for C&P problems. presentation, and final discussion. In: 2nd ESICUP Meeting, Southampton, UK (April 2005)"},{"issue":"8","key":"26_CR21","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1016\/j.cor.2005.01.009","volume":"33","author":"D. Zhang","year":"2006","unstructured":"Zhang, D., Kang, Y., Deng, A.: A new heuristic recursive algorithm for the strip rectangular packing problem. Computers and Operations Research\u00a033(8), 2209\u20132217 (2006)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:31:23Z","timestamp":1558290683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}