{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:11:44Z","timestamp":1753737104071},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385766"},{"type":"electronic","value":"9783642385773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38577-3_24","type":"book-chapter","created":{"date-parts":[[2013,5,19]],"date-time":"2013-05-19T21:31:53Z","timestamp":1368999113000},"page":"232-241","source":"Crossref","is-referenced-by-count":2,"title":["A Bidirectional Building Approach for the 2D Guillotine Knapsack Packing Problem"],"prefix":"10.1007","author":[{"given":"Lijun","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"24_CR1","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(1), 30\u201344 (1977)","journal-title":"Operations Research"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"P.Y. Wang","year":"1983","unstructured":"Wang, P.Y.: Two algorithms for constrained two-dimensional cutting stock problems. Operations Research\u00a031(3), 573\u2013586 (1983)","journal-title":"Operations Research"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/opre.41.4.768","volume":"41","author":"K.V. Viswanathan","year":"1993","unstructured":"Viswanathan, K.V., Bagchi, A.: Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research\u00a041(4), 768\u2013776 (1993)","journal-title":"Operations Research"},{"issue":"8","key":"24_CR4","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/S0305-0548(96)00095-0","volume":"24","author":"M. Hifi","year":"1997","unstructured":"Hifi, M.: An improvement of Viswanathan and Bagchi\u2019s exact algorithm for constrained two-dimensional cutting stock. Computers & Operations Research\u00a024(8), 727\u2013736 (1997)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1111\/j.1475-3995.2000.tb00194.x","volume":"7","author":"V.D. Cung","year":"2000","unstructured":"Cung, V.D., Hifi, M., Le Cun, B.: Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm. International Transactions in Operational Research\u00a07(3), 185\u2013210 (2000)","journal-title":"International Transactions in Operational Research"},{"key":"24_CR6","unstructured":"Yoon, K., Ahn, S., Kang, M.K.: An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems. International Journal of Production Research, 1\u201314 (June, October 2012)"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.cor.2010.12.018","volume":"39","author":"M. Dolatabadi","year":"2012","unstructured":"Dolatabadi, M., Lodi, A., Monaci, M.: Exact algorithms for the two-dimensional guillotine knapsack. Computers & Operations Research\u00a039(1), 48\u201353 (2012)","journal-title":"Computers & Operations Research"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/B:JOCO.0000021938.49750.91","volume":"8","author":"M. Hifi","year":"2004","unstructured":"Hifi, M.: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems. Journal of Combinatorial Optimization\u00a08, 65\u201384 (2004)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"24_CR9","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 of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research\u00a0128(1), 34\u201357 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1111\/j.1475-3995.2009.00701.x","volume":"16","author":"A. Bortfeldt","year":"2009","unstructured":"Bortfeldt, A., Winter, T.: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. International Transactions in Operational Research\u00a016(6), 685\u2013713 (2009)","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0377-2217(03)00139-5","volume":"156","author":"J.E. Beasley","year":"2004","unstructured":"Beasley, J.E.: A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research\u00a0156(3), 601\u2013627 (2004)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10589-007-9103-3","volume":"41","author":"Y. Chen","year":"2008","unstructured":"Chen, Y.: A recursive algorithm for constrained two-dimensional cutting problems. Computational Optimization and Applications\u00a041(3), 337\u2013348 (2008)","journal-title":"Computational Optimization and Applications"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38577-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:27:11Z","timestamp":1557703631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38577-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385766","9783642385773"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38577-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}