{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:43:57Z","timestamp":1787334237065,"version":"build-2736575974"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,13]],"date-time":"2008-11-13T00:00:00Z","timestamp":1226534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10479-008-0457-4","type":"journal-article","created":{"date-parts":[[2008,11,12]],"date-time":"2008-11-12T11:20:04Z","timestamp":1226488804000},"page":"297-315","source":"Crossref","is-referenced-by-count":32,"title":["A heuristic approach based on dynamic programming and and\/or-graph search for the constrained two-dimensional guillotine cutting problem"],"prefix":"10.1007","volume":"179","author":[{"given":"Reinaldo","family":"Morabito","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vit\u00f3ria","family":"Pureza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,11,13]]},"reference":[{"key":"457_CR1","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/S0305-0548(00)00095-2","volume":"29","author":"R. Alvarez-Vald\u00e9s","year":"2002","unstructured":"Alvarez-Vald\u00e9s, R., Paraj\u00f3n, A., & Tamarit, J. (2002). A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Computers and Operations Research, 29, 925\u2013947.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"457_CR2","first-page":"107","volume":"19","author":"M. Arenales","year":"1999","unstructured":"Arenales, M., Morabito, R., & Yanasse, H. (Eds.) (1999). Cutting and packing problems. Pesquisa Operacional, 19(2), 107\u2013299.","journal-title":"Pesquisa Operacional"},{"issue":"4","key":"457_CR3","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. (1985). Algorithms for unconstrained two-dimensional guilhotine cutting. Journal of the Operational Research Society, 36(4), 297\u2013306.","journal-title":"Journal of the Operational Research Society"},{"key":"457_CR4","first-page":"3","volume":"84","author":"E. Bischoff","year":"1995","unstructured":"Bischoff, E., & Waescher, G. (Eds.) (1995). Cutting and packing. European Journal of Operational Research, 84, 3.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"457_CR5","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E. Burke","year":"2004","unstructured":"Burke, E., Kendall, G., & Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operations Research, 52(4), 655\u2013671.","journal-title":"Operations Research"},{"key":"457_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","volume":"83","author":"N. Christofides","year":"1995","unstructured":"Christofides, N., & Hadjiconstantinou, E. (1995). An exact algorithm for orthogonal 2-d cutting problems using guillotine cuts. European Journal of Operational Research, 83, 21\u201338.","journal-title":"European Journal of Operational Research"},{"key":"457_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., & Toth, P. (1981). State-space relaxation procedure for the computation of bounds to routing problems. Networks, 11, 145\u2013164.","journal-title":"Networks"},{"issue":"1","key":"457_CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N. Christofides","year":"1977","unstructured":"Christofides, N., & Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1), 30\u201344.","journal-title":"Operations Research"},{"key":"457_CR9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.cor.2006.02.029","volume":"35","author":"Y. Cui","year":"2008","unstructured":"Cui, Y. (2008). Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns. Computers and Operations Research, 35, 212\u2013225.","journal-title":"Computers and Operations Research"},{"key":"457_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.1475-3995.2000.tb00194.x","volume":"7","author":"V. Cung","year":"2000","unstructured":"Cung, V., Hifi, M., & Le Cun, B. (2000). Constrained two-dimensional guillotine cutting stock problems: A best-first branch-and-bound algorithm. International Transactions in Operational Research, 7, 185\u2013201.","journal-title":"International Transactions in Operational Research"},{"key":"457_CR11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"K. Dowsland","year":"1992","unstructured":"Dowsland, K., & Dowsland, W. (1992). Packing problems. European Journal of Operational Research, 56, 2\u201314.","journal-title":"European Journal of Operational Research"},{"key":"457_CR12","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2004.04.030","volume":"168","author":"K. Dowsland","year":"2006","unstructured":"Dowsland, K., Herbert, E., Kendall, G., & Burke, E. (2006). Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems. European Journal of Operational Research, 168, 390\u2013402.","journal-title":"European Journal of Operational Research"},{"key":"457_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58165-6","volume-title":"Cutting and packing in production and distribution: typology and bibliography","author":"H. Dyckhoff","year":"1992","unstructured":"Dyckhoff, H., & Finke, U. (1992). Cutting and packing in production and distribution: typology and bibliography. Heidelberg: Springer."},{"key":"457_CR14","first-page":"393","volume-title":"Annoted bibliographies in combinatorial optimization","author":"H. Dyckhoff","year":"1997","unstructured":"Dyckhoff, H., Scheithauer, G., & Terno, J. (1997). Cutting and packing. In M. Amico, F. Maffioli, & S.\u00a0Martello (Eds.), Annoted bibliographies in combinatorial optimization (pp. 393\u2013414). New York: Wiley."},{"key":"457_CR15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff, H., & Waescher, G. (Eds.) (1990). Cutting and packing. European Journal of Operational Research, 44, 2.","journal-title":"European Journal of Operational Research"},{"key":"457_CR16","unstructured":"ESICUP\u2014Euro special interest group on cutting and packing. Available in: http:\/\/www.apdio.pt\/esicup\/ (accessed in 2008)."},{"key":"457_CR17","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1057\/palgrave.jors.2600638","volume":"49","author":"D. Fayard","year":"1998","unstructured":"Fayard, D., Hifi, M., & Zissimopoulos, V. (1998). An efficient approach for large-scale two-dimensional guillotine cutting stock problems. Journal of the Operational Research Society, 49, 1270\u20131277.","journal-title":"Journal of the Operational Research Society"},{"key":"457_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10898-005-1657-y","volume":"34","author":"D. Fontes","year":"2006","unstructured":"Fontes, D., Hadjiconstantinou, E., & Christofides, N. (2006). Lower bounds from state space relaxations for concave cost network flow problems. Journal of Global Optimization, 34, 97\u2013125.","journal-title":"Journal of Global Optimization"},{"key":"457_CR19","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P. Gilmore","year":"1966","unstructured":"Gilmore, P., & Gomory, R. (1966). The theory and computation of knapsack functions. Operations Research, 14, 1045\u20131074.","journal-title":"Operations Research"},{"key":"457_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02098280","volume":"61","author":"E. Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou, E., & Christofides, N. (1995). A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Annals of Operations Research, 61, 21\u201343.","journal-title":"Annals of Operations Research"},{"issue":"8","key":"457_CR21","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/S0305-0548(96)00095-0","volume":"24","author":"M. Hifi","year":"1997","unstructured":"Hifi, M. (1997a). An improvement of Viswanathan and Bagchi\u2019s exact algorithm for constrained two-dimensional cutting stock. Computers and Operations Research, 24(8), 727\u2013736.","journal-title":"Computers and Operations Research"},{"key":"457_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0377-2217(96)00060-4","volume":"97","author":"M. Hifi","year":"1997","unstructured":"Hifi, M. (1997b). The DH\/KD algorithm: a hybrid approach for unconstrained cutting problems. European Journal of Operational Research, 97, 41\u201352.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"457_CR23","first-page":"1","volume":"2","author":"M. Hifi","year":"2002","unstructured":"Hifi, M. (Ed.) (2002). Special issue: Cutting and packing problems. Studia Informatica Universalis, 2(1), 1\u2013161.","journal-title":"Studia Informatica Universalis"},{"key":"457_CR24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/B:JOCO.0000021938.49750.91","volume":"8","author":"M. Hifi","year":"2004","unstructured":"Hifi, M. (2004). Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems. Journal of Combinatorial Optimization, 8, 65\u201384.","journal-title":"Journal of Combinatorial Optimization"},{"key":"457_CR25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A. Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: a survey. European Journal of Operational Research, 141, 241\u2013252.","journal-title":"European Journal of Operational Research"},{"key":"457_CR26","unstructured":"Lucena, A. (2004). Non delayed relax-and-cut algorithms (Working Paper). Universidade Federal do Rio de Janeiro, Brazil."},{"key":"457_CR27","first-page":"3","volume":"32","author":"S. Martello","year":"1994","unstructured":"Martello, S. (Ed.) (1994a) Special issue: Knapsack, packing and cutting, Part I: One dimensional knapsack problems. INFOR, 32, 3.","journal-title":"INFOR"},{"key":"457_CR28","first-page":"4","volume":"32","author":"S. Martello","year":"1994","unstructured":"Martello, S. (Ed.) (1994b) Special issue: Knapsack, packing and cutting, Part II: Multidimensional knapsack and cutting stock problems. INFOR, 32, 4.","journal-title":"INFOR"},{"key":"457_CR29","unstructured":"Mukhacheva, E. A. (Ed.). (1997). Decision making under conditions of uncertainty: cutting\u2013packing problems. The International Scientific Collection, Ufa, Russia."},{"issue":"1","key":"457_CR30","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0969-6016(94)90046-9","volume":"1","author":"R. Morabito","year":"1994","unstructured":"Morabito, R., & Arenales, M. (1994). An and\/or-graph approach to the container loading problem. International Transactions in Operational Research, 1(1), 59\u201373.","journal-title":"International Transactions in Operational Research"},{"key":"457_CR31","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/0377-2217(95)00128-X","volume":"94","author":"R. Morabito","year":"1996","unstructured":"Morabito, R., & Arenales, M. (1996). Staged and constrained two-dimensional guilhotine cutting problems: An and\/or-graph approach. European Journal of Operational Research, 94, 548\u2013560.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"457_CR32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(92)90212-R","volume":"58","author":"R. Morabito","year":"1992","unstructured":"Morabito, R., Arenales, M., & Arcaro, V. (1992). An and\/or-graph approach for two-dimensional cutting problems. European Journal of Operational Research, 58(2), 263\u2013271.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"457_CR33","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0360-8352(96)00194-5","volume":"32","author":"V. Mornar","year":"1997","unstructured":"Mornar, V., & Khoshnevis, B. (1997). A cutting stock procedure for printed circuit board production. Computers and Industrial Engineering, 32(1), 57\u201366.","journal-title":"Computers and Industrial Engineering"},{"key":"457_CR34","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0377-2217(90)90361-E","volume":"44","author":"J. F. Oliveira","year":"1990","unstructured":"Oliveira, J. F., & Ferreira, J. S. (1990). An improved version of Wang\u2019s algorithm for two-dimensional cutting problems. European Journal of Operational Research, 44, 256\u2013266.","journal-title":"European Journal of Operational Research"},{"key":"457_CR35","doi-asserted-by":"crossref","unstructured":"Oliveira, J. F., & Waescher, G. (Eds.) (2007). Special issue on cutting and packing. European Journal of Operational Research, 183.","DOI":"10.1016\/j.ejor.2006.04.022"},{"key":"457_CR36","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/0377-2217(95)00028-O","volume":"84","author":"V. Parada","year":"1995","unstructured":"Parada, V., Alvarenga, A. G., & Diego, J. (1995). Exact solutions for constrained two-dimensional cutting problems. European Journal of Operational Research, 84, 633\u2013644.","journal-title":"European Journal of Operational Research"},{"key":"457_CR37","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0305-0548(98)80006-3","volume":"25","author":"V. Parada","year":"1998","unstructured":"Parada, V., Sepulveda, M., Solar, M., & Gomes, A. (1998). Solution for the constrained guillotine cutting problem by simulated annealing. Computers and Operations Research, 25, 37\u201347.","journal-title":"Computers and Operations Research"},{"key":"457_CR38","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1018915922011","volume":"96","author":"V. Parada","year":"2000","unstructured":"Parada, V., Palma, R., Sales, D., & Gomes, A. (2000). A comparative numerical analysis for the guillotine two-dimensional cutting problem. Annals of Operations Research, 96, 245\u2013254.","journal-title":"Annals of Operations Research"},{"key":"457_CR39","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","volume":"43","author":"P. Sweeney","year":"1992","unstructured":"Sweeney, P., & Paternoster, E. (1992). Cutting and packing problems: a categorized, application-oriented research bibliography. Journal of the Operational Research Society, 43, 691\u2013706.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"457_CR40","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0360-8352(89)90013-2","volume":"16","author":"F. J. Vasko","year":"1989","unstructured":"Vasko, F. J. (1989). A computational improvement to Wang\u2019s two-dimensional cutting stock algorithm. Computers and Industrial Engineering, 16(1), 109\u2013115.","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"457_CR41","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.41.4.768","volume":"41","author":"K. V. Viswanathan","year":"1993","unstructured":"Viswanathan, K. V., & Bagchi, A. (1993). Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research, 41(4), 768\u2013776.","journal-title":"Operations Research"},{"key":"457_CR42","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. Waescher","year":"2007","unstructured":"Waescher, G., Haussner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"key":"457_CR43","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"P. Y. Wang","year":"1983","unstructured":"Wang, P. Y. (1983). Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31, 573\u2013586.","journal-title":"Operations Research"},{"issue":"2","key":"457_CR44","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0377-2217(02)00122-4","volume":"141","author":"P. Y. Wang","year":"2002","unstructured":"Wang, P. Y., & Waescher, G. (Eds.) (2002). Cutting and packing. European Journal of Operational Research, 141(2), 239\u2013469.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0457-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0457-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0457-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:51Z","timestamp":1559138871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0457-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,13]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["457"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0457-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,13]]}}}