{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:22:11Z","timestamp":1775082131434,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1011628809603","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T10:59:33Z","timestamp":1040641173000},"page":"465-494","source":"Crossref","is-referenced-by-count":54,"title":["Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Roucairol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"356223_CR1","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","volume":"10","author":"A. Albano","year":"1980","unstructured":"A. Albano and G. Sapuppo, \u201cOptimal allocation of two-dimensional irregular shapes using heuristic search meth-ods,\u201d IEEE, Trans. Sys. Man. Cyb., vol. 10, no 5, pp. 242\u2013248, 1980.","journal-title":"IEEE, Trans. Sys. Man. Cyb."},{"key":"356223_CR2","unstructured":"M. Arenales and R. Morabito, \u201cAn overview of and-or-graph approach to cutting and packing problems,\u201d ISBN 5\u201386911\u2013161\u20137, 1997, pp. 207\u2013224."},{"key":"356223_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":"356223_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","volume":"83","author":"N. Christofides","year":"1995","unstructured":"N. Christofides and E. Hadjiconstantinou, \u201cAn exact algorithm for orthogonal 2-D cutting problems using guillotine cuts,\u201d European Journal of Operational Research, vol. 83, pp. 21\u201338, 1995.","journal-title":"European Journal of Operational Research"},{"key":"356223_CR5","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":"356223_CR6","first-page":"185","volume":"7","author":"V-D. Cung","year":"2000","unstructured":"V-D. Cung, M. Hifi, and B. Le Cun, \u201cConstrained two-dimensional cutting stock problems: A best-first branch-and-bound algorithm,\u201d International Transactions in Operational Research, vol. 7, pp. 185\u2013210, 2000.","journal-title":"International Transactions in Operational Research"},{"key":"356223_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":"356223_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":"356223_CR9","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":"356223_CR10","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":"356223_CR11","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":"356223_CR12","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1147\/rd.165.0462","volume":"16","author":"J.C. Herz","year":"1972","unstructured":"J.C. 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":"356223_CR13","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":"356223_CR14","unstructured":"M. Hifi, \u201cContribution \u00e0 la r\u00e9solution de quelques probl\u00e8mes difficiles de l'optimisation combinatoire,\u201d Habilitation Thesis. PRi SM, Universit\u00e9 de Versailles St-Quentin en Yvelines, 1999."},{"key":"356223_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1008743711658","volume":"18","author":"M. Hifi","year":"2001","unstructured":"M. Hifi, \u201cExact algorithms for large-scale unconstrained two and three staged cutting problems,\u201d Computational Optimization and Applications, vol. 18, pp. 63\u201388, 2001.","journal-title":"Computational Optimization and Applications"},{"key":"356223_CR16","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 problems,\u201d European Journal of Operational Research, vol. 91, pp. 553\u2013564, 1996.","journal-title":"European Journal of Operational Research"},{"key":"356223_CR17","first-page":"8","volume":"5","author":"M. Hifi","year":"1997","unstructured":"M. Hifi and V. Zissimopoulos, \u201cConstrained two-dimensional cutting: An improvement of Christofides and Whit-lock's exact algorithm,\u201d Journal of the Operational Research Society, vol. 5, pp. 8\u201318, 1997.","journal-title":"Journal of the Operational Research Society"},{"key":"356223_CR18","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":"356223_CR19","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":"356223_CR20","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\u20131 knapsack problems,\u201d Operations Research, vol. 45, pp. 768\u2013778, 1997.","journal-title":"Operations Research"},{"issue":"3","key":"356223_CR21","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, no. 3, pp. 548\u2013560, 1996.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"356223_CR22","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-or-graph approach for two-dimensional cutting problems,\u201d European Journal of Operational Research, vol. 58, no. 2, pp. 263\u2013271, 1992.","journal-title":"European Journal of Operational Research"},{"key":"356223_CR23","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":"356223_CR24","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\u20131 knapsack problem,\u201d Operations Research, vol. 45, pp. 758\u2013767, 1997.","journal-title":"Operations Research"},{"key":"356223_CR25","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":"356223_CR26","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."},{"issue":"4","key":"356223_CR27","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.41.4.768","volume":"41","author":"K.V. Viswanathan","year":"1993","unstructured":"K.V. Viswanathan and A. Bagchi, \u201cBest-first search methods for constrained two-dimensional cutting stock prob-lems,\u201d Operations Research, vol. 41, no. 4, pp. 768\u2013776, 1993.","journal-title":"Operations Research"},{"issue":"3","key":"356223_CR28","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"P.Y. Wang","year":"1983","unstructured":"P.Y. Wang, \u201cTwo algorithms for constrained two-dimensional cutting stock problems,\u201d Operations Research, vol. 31, no. 3, pp. 573\u2013586, 1983.","journal-title":"Operations Research"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011628809603.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011628809603\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011628809603.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:12:40Z","timestamp":1751281960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011628809603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["356223"],"URL":"https:\/\/doi.org\/10.1023\/a:1011628809603","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}