{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:20:53Z","timestamp":1775082053913,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1023\/a:1008743711658","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"63-88","source":"Crossref","is-referenced-by-count":62,"title":["Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems"],"prefix":"10.1007","volume":"18","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"312951_CR1","series-title":"Technical Report","volume-title":"Dynamic programming parallel implementation for the knapsack problem","author":"R. Andonov","year":"1993","unstructured":"R. Andonov, F. Raimbault, and P. Quinton, \u201cDynamic programming parallel implementation for the knapsack problem, \u201d Technical Report, PI-740, IRISA, Campus de Banlieu, Rennes, France, 1993."},{"key":"312951_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/jpdc.1997.1371","volume":"45","author":"R. Andonov","year":"1997","unstructured":"R. Andonov and S. Rajopadhye, \u201cOptimal orthogonal tiling of 2-D iterations, \u201d Journal of Parallel and Distributed Computing, vol. 45, pp. 159\u2013165, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"312951_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"J.E. Beasley","year":"1985","unstructured":"J.E. Beasley, \u201cAlgorithms for unconstrained two-dimensional guillotine cutting, \u201d Journal of the Operational Research Society, vol. 36, pp. 297\u2013306, 1985.","journal-title":"Journal of the Operational Research Society"},{"key":"312951_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0167-8191(90)90124-R","volume":"13","author":"G.H. Chen","year":"1990","unstructured":"G.H. Chen, M.S. Chern, and J.H. Jang, \u201cPipeline architectures for dynamic programming algorithms, \u201d Parallel Computing, vol. 13, pp. 111\u2013117, 1990.","journal-title":"Parallel Computing"},{"key":"312951_CR5","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/0167-8191(92)90047-B","volume":"18","author":"G.H. Chen","year":"1992","unstructured":"G.H. Chen, M.S. Chern, and J.H. Jang, \u201cAn improved parallel algorithm for 0\/1 knapsack problem, \u201d Parallel Computing, vol. 18, pp. 811\u2013821, 1992.","journal-title":"Parallel Computing"},{"key":"312951_CR6","first-page":"31","volume":"2","author":"N. Christofides","year":"1977","unstructured":"N. Christofides and C. Whitlock, \u201cAn algorithm for two-dimensional cutting problems, \u201d Operations Research, vol. 2, pp. 31\u201344, 1977.","journal-title":"Operations Research"},{"key":"312951_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"H. Dyckhoff, \u201cA typology of cutting and packing problems, \u201d European Journal of Operational Research, vol. 44, pp. 145\u2013159, 1990.","journal-title":"European Journal of Operational Research"},{"key":"312951_CR8","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1057\/palgrave.jors.2600638","volume":"49","author":"D. Fayard","year":"1998","unstructured":"D. Fayard, M. Hifi, and V. Zissimopoulos, \u201cAn efficient approach for large-scale two-dimensional guillotine cutting stock problems, \u201d Journal of the Operational Research Society, vol. 49, pp. 1270\u20131277, 1998.","journal-title":"Journal of the Operational Research Society"},{"key":"312951_CR9","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0377-2217(93)E0221-I","volume":"84","author":"D. Fayard","year":"1995","unstructured":"D. Fayard and V. Zissimopoulos, \u201cAn approximation algorithm for solving unconstrained two-dimensional knapsack problems, \u201d European Journal of Operational Research, vol. 84, pp. 618\u2013632, 1995.","journal-title":"European Journal of Operational Research"},{"key":"312951_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0167-5060(08)70828-8","volume":"4","author":"P.C. Gilmore","year":"1979","unstructured":"P.C. Gilmore, \u201cCutting stock, linear programming, knapsacking, dynamic programming and integer programming, some interconnections, \u201d Annals of Discrete Mathematics, vol. 4, pp. 217\u2013235, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"312951_CR11","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P.C. Gilmore","year":"1965","unstructured":"P.C. Gilmore and R.E. Gomory, \u201cMultistage cutting problems of two and more dimensions, \u201d Operations Research, vol. 13, pp. 94\u2013119, 1965.","journal-title":"Operations Research"},{"key":"312951_CR12","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P.C. Gilmore","year":"1966","unstructured":"P.C. Gilmore and R.E. Gomory, \u201cThe theory and computation of knapsack functions, \u201d Operations Research, vol. 14, pp. 1045\u20131074, 1966.","journal-title":"Operations Research"},{"key":"312951_CR13","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1147\/rd.165.0462","volume":"16","author":"J. Herz","year":"1972","unstructured":"J. Herz, \u201cA recursive computing procedure for two-dimensional stock cutting, \u201d IBM Journal of Research and Development, vol. 16, pp. 462\u2013469, 1972.","journal-title":"IBM Journal of Research and Development"},{"key":"312951_CR14","unstructured":"M. Hifi, \u201cStudy of some combinatorial optimization problems: Cutting stock, packing and set covering problems, \u201d PhD Thesis. Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne, CERMSEM, 1994."},{"key":"312951_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0377-2217(96)00060-4","volume":"97","author":"M. Hifi","year":"1997","unstructured":"M. Hifi, \u201cThe DH\/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems, \u201d European Journal of Operational Research, vol. 97, pp. 41\u201352, 1997.","journal-title":"European Journal of Operational Research"},{"key":"312951_CR16","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/S0305-0548(96)00095-0","volume":"24","author":"M. Hifi","year":"1997","unstructured":"M. Hifi, \u201cAn improvement of Viswanathan and Bagchi's exact algorithm for cutting stock problems, \u201d Computers and Operations Research, vol. 24, pp. 727\u2013736, 1997.","journal-title":"Computers and Operations Research"},{"key":"312951_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1051\/ro\/1996300201111","volume":"30","author":"M. Hifi","year":"1996","unstructured":"M. Hifi and V. Zissimopoulos, \u201cUne am\u00e9lioration de l'algorithme r\u00e9cursif de Herz pour le probl`eme de d\u00e9coupe \u00e0 deux dimensions, \u201d RAIRO, Operations Research, vol. 30, pp. 111\u2013126, 1996.","journal-title":"RAIRO, Operations Research"},{"key":"312951_CR18","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(95)00343-6","volume":"91","author":"M. Hifi","year":"1996","unstructured":"M. Hifi and V. Zissimopoulos, \u201cA recursive exact algorithm for weighted two-dimensional cutting, \u201d European Journal of Operational Research, vol. 91, pp. 553\u2013564, 1996.","journal-title":"European Journal of Operational Research"},{"key":"312951_CR19","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1057\/palgrave.jors.2600364","volume":"48","author":"M. Hifi","year":"1997","unstructured":"M. Hifi and V. Zissimopoulos, \u201cConstrained two-dimensional cutting: An improvement of Christofides and Whitlock's exact algorithm, \u201d Journal of the Operational Research Society, vol. 48, pp. 324\u2013331, 1997.","journal-title":"Journal of the Operational Research Society"},{"key":"312951_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"L.K. Kantorovich","year":"1960","unstructured":"L.K. Kantorovich, \u201cMathematical methods of organizing and planning production, \u201d Management Science, vol. 6, pp. 363\u2013422, 1960.","journal-title":"Management Science"},{"key":"312951_CR21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E.L. Lawler","year":"1979","unstructured":"E.L. Lawler, \u201cFast approximation algorithms for knapsack problems, \u201d Mathematics of Operations Research, vol. 4, pp. 339\u2013356, 1979.","journal-title":"Mathematics of Operations Research"},{"key":"312951_CR22","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-6377(90)90035-4","volume":"9","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth, \u201cAn exact algorithm for large unbounded knapsack problems, \u201d Operations Research Letters, vol. 9, pp. 15\u201320, 1990.","journal-title":"Operations Research Letters"},{"key":"312951_CR23","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.45.5.768","volume":"45","author":"S. Martello","year":"1997","unstructured":"S. Martello and P. Toth, \u201cUpper bounds and algorithms for hard 0-1 knapsack problems, \u201d Operations Research, vol. 45, pp. 768\u2013778, 1997.","journal-title":"Operations Research"},{"key":"312951_CR24","first-page":"145","volume":"33","author":"R. Morabito","year":"1995","unstructured":"R. Morabito and M. Arenales, \u201cPerformance of two heuristics for solving large scale two-dimensional guillotine cutting problems, \u201d IFOR, vol. 33, pp. 145\u2013155, 1995.","journal-title":"IFOR"},{"key":"312951_CR25","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/0377-2217(95)00128-X","volume":"94","author":"R. Morabito","year":"1996","unstructured":"R. Morabito and M. Arenales, \u201cStaged and constrained two-dimensional guillotine cutting problems: An and\/or-graph approach, \u201d European Journal of Operational Research, vol. 94, pp. 548\u2013560, 1996.","journal-title":"European Journal of Operational Research"},{"key":"312951_CR26","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(92)90212-R","volume":"58","author":"R. Morabito","year":"1992","unstructured":"R. Morabito, M. Arenales, and V. Arcaro, \u201cAn and\u2013or-graph approach for two-dimensional cutting problems, \u201d European Journal of Operational Research, vol. 58, pp. 263\u2013271, 1992.","journal-title":"European Journal of Operational Research"},{"key":"312951_CR27","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0305-0548(97)00087-7","volume":"25","author":"R. Morabito","year":"1998","unstructured":"R. Morabito and V. Garcia, \u201cThe cutting stock problem in hardboard industry: A case study, \u201d Computers and Operations Research, vol. 25, pp. 469\u2013485, 1998.","journal-title":"Computers and Operations Research"},{"key":"312951_CR28","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D. Pisinger","year":"1997","unstructured":"D. Pisinger, \u201cA minimal algorithm for the 0-1 knapsack problem, \u201d Operations Research, vol. 45, pp. 758\u2013767, 1997.","journal-title":"Operations Research"},{"key":"312951_CR29","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","volume":"43","author":"P.E. Sweeney","year":"1992","unstructured":"P.E. Sweeney and E.R. Paternoster, \u201cCutting and packing problems: A categorized applications-oriented research bibliography, \u201d Journal of the Operational Research Society, vol. 43, pp. 691\u2013706, 1992.","journal-title":"Journal of the Operational Research Society"},{"key":"312951_CR30","volume-title":"Discrete Optimization Algorithms","author":"M. Syslo","year":"1983","unstructured":"M. Syslo, N. Deo, and J. Kowalik, Discrete Optimization Algorithms, Prentice-Hall: New Jersey, 1983."},{"key":"312951_CR31","first-page":"345","volume":"49","author":"V. Zissimopoulos","year":"1984","unstructured":"V. Zissimopoulos, \u201cHeuristic methods for solving (un)constrained two-dimensional cutting stock problems, \u201d Methods of Operations Research, vol. 49, pp. 345\u2013357, 1984.","journal-title":"Methods of Operations Research"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008743711658.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008743711658\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008743711658.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:24:20Z","timestamp":1752377060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008743711658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["312951"],"URL":"https:\/\/doi.org\/10.1023\/a:1008743711658","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}