{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:52:12Z","timestamp":1777503132077,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0305-0548(98)00008-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:59:16Z","timestamp":1027612756000},"page":"925-940","source":"Crossref","is-referenced-by-count":59,"title":["Exact algorithms for the guillotine strip cutting\/packing problem"],"prefix":"10.1016","volume":"25","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/S0305-0548(98)00008-2_BIB1","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/S0305-0548(96)00095-0","article-title":"An improvement of Viswanathan and Bagchi's exact algorithm for cutting stock problems","volume":"24","author":"Hifi","year":"1997","journal-title":"Computers and Operations Research"},{"issue":"4","key":"10.1016\/S0305-0548(98)00008-2_BIB2","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.41.4.768","article-title":"Best-first search methods for constrained two-dimensional cutting stock problems","volume":"41","author":"Viswanathan","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dyckhoff","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB4","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"Cutting and packing problems: a categorized applications-oriented research bibliography","volume":"43","author":"Sweeney","year":"1992","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/S0305-0548(98)00008-2_BIB5","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","article-title":"Orthogonal packing in two dimensions","volume":"9","author":"Baker","year":"1980","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.1016\/S0305-0548(98)00008-2_BIB6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","article-title":"A 5\/4 algorithm for two-dimensional packing","volume":"2","author":"Baker","year":"1981","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB7","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","article-title":"Performance bounds for level oriented two-dimensional packing problem","volume":"9","author":"Coffman","year":"1980","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-6377(89)90026-6","article-title":"Expected performance of the shelf heuristic for two-dimensional packing","volume":"8","author":"Bartholdi","year":"1989","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/S0305-0548(98)00008-2_BIB9","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0218011","article-title":"Algorithms for packing squares: a probabilistic analysis","volume":"18","author":"Coffman","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB10","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0377-2217(90)90349-G","article-title":"Average-case analysis of cutting and packing in two dimensions","volume":"44","author":"Coffman","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0305-0548(98)00008-2_BIB11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved within 1+\u03f5 in linear time","volume":"1","author":"Fernandez de la Vega","year":"1981","journal-title":"Combinatoria"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB12","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0377-2217(80)90068-5","article-title":"The trim-loss and assortment problems: a survey","volume":"5","author":"Hinxman","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(80)90817-7","article-title":"Two-dimensional packing: Expected performance of simple level algorithms","volume":"45","author":"Hofri","year":"1980","journal-title":"Information and Control"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","article-title":"On genetic algorithms for the packing of polygons","volume":"88","author":"Jakobs","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"B","key":"10.1016\/S0305-0548(98)00008-2_BIB15","first-page":"260","article-title":"Simple perfect squared square of lowest order","volume":"25","author":"Duijvestijn","year":"1978","journal-title":"Journal of Combinatorial Theory"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB16","unstructured":"Federico, P. J., Bondy, J. A. and Murty, U. S. R., Squaring rectangles and squares. In Graph Theory and Related Topics. Editions Academic Press, 1979"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB17","doi-asserted-by":"crossref","unstructured":"Hifi, M. and Ouafi R., A best-first branch-and-bound algorithm for orthogonal rectangular packing problems. International Transactions in Operational Research (to appear)","DOI":"10.1111\/j.1475-3995.1998.tb00119.x"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB18","doi-asserted-by":"crossref","unstructured":"Kleitman, D. J. and Krieger, M. K., An optimal bound for two dimensional bin packing. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science. 1975, pp. 163\u2013168","DOI":"10.1109\/SFCS.1975.6"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB19","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1057\/jors.1985.51","article-title":"Algorithms for unconstrained two-dimensional guillotine cutting","volume":"36","author":"Beasley","year":"1985","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB20","first-page":"31","article-title":"An algorithm for two-dimensional cutting problems","volume":"2","author":"Christofides","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB21","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","article-title":"The theory and computation of knapsack functions","volume":"14","author":"Gilmore","year":"1965","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(98)00008-2_BIB22","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB23","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02243880","article-title":"Dynamic programming algorithms for zero-one knapsack problem","volume":"25","author":"Toth","year":"1980","journal-title":"Computing"},{"issue":"3","key":"10.1016\/S0305-0548(98)00008-2_BIB24","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.31.3.573","article-title":"Two algorithms for constrained two-dimensional cutting stock problems","volume":"31","author":"Wang","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB25","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0010-4485(77)90062-8","article-title":"A method to improve two-dimensional layout","volume":"9","author":"Albano","year":"1977","journal-title":"Comp. Aid. Des."},{"issue":"5","key":"10.1016\/S0305-0548(98)00008-2_BIB26","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","article-title":"Optimal allocation of two-dimensional irregular shapes using heuristic search methods","volume":"10","author":"Albano","year":"1980","journal-title":"IEEE Trans. Sys. Man. Cyb."},{"key":"10.1016\/S0305-0548(98)00008-2_BIB27","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0377-2217(90)90361-E","article-title":"An improved version of Wang's algorithm for two-dimensional cutting problems","volume":"44","author":"Oliveira","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0360-8352(89)90013-2","article-title":"A computational improvement to Wang's two-dimensional cutting stock algorithm","volume":"16","author":"Vasko","year":"1989","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB29","first-page":"345","article-title":"Heuristic methods for solving (un)constrained two-dimensional cutting stock problems","volume":"49","author":"Zissimopoulos","year":"1984","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB30","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(95)00343-6","article-title":"A recursive exact algorithm for weighted two-dimensional cutting","volume":"91","author":"Hifi","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB31","unstructured":"Fayard, D., Hifi, M. and Zissimopoulos, V., A general efficient approach for large-scale two-dimensional cutting stock problems. Working Paper Eco and Maths. CERMSEM, Universit\u00e9 de Paris 1, 90 rue de Tolbiac, 75013 Paris, France, 1996"},{"issue":"4","key":"10.1016\/S0305-0548(98)00008-2_BIB32","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB33","unstructured":"Garey, M. R. and Johnson, D. S., Computers and Intractability. A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, 1979"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB34","unstructured":"Andonov, R., Raimbault, F. and Quinton, P., Dynamic programming: parallel implementation for the knapsack problem. Preprint IRISA, No. 740. Campus de Beaulieu, 35042 Rennes Cedex, 1993"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0167-8191(90)90124-R","article-title":"Pipeline architectures for dynamic programming algorithms","volume":"13","author":"Chen","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/S0305-0548(98)00008-2_BIB36","unstructured":"Cung, V.-D., Hifi, M. and Le Cun, B., Constrained two-dimensional cutting stock problems and the BOB Library: A parallel algorithm. 16th International Symposium on Mathematical Programming ISMP97. Ecole Polytechnique Federale de Lausanne, Switzerland, August 24\u201329, 1997"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054898000082?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054898000082?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T14:52:17Z","timestamp":1556290337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054898000082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":36,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0305054898000082"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(98)00008-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}