{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T06:08:01Z","timestamp":1775887681096,"version":"3.50.1"},"reference-count":18,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1051\/ro:2008027","type":"journal-article","created":{"date-parts":[[2008,10,13]],"date-time":"2008-10-13T15:10:20Z","timestamp":1223910620000},"page":"435-453","source":"Crossref","is-referenced-by-count":20,"title":["A branch-and-price-and-cut algorithm for the pattern minimization problem"],"prefix":"10.1051","volume":"42","author":[{"given":"Cl\u00e1udio","family":"Alves","sequence":"first","affiliation":[]},{"given":"J.M.","family":"Val\u00e9rio de Carvalho","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2009,4,4]]},"reference":[{"key":"R1","unstructured":"C. Alves,Cutting and packing: problems, models and exact algorithms. Ph.D. Thesis, Universidade do Minho (2005)."},{"key":"R2","unstructured":"J.M. Allwood and C.N. Goulimis.Reducing the number of patterns in one-dimensional cutting stock problems. Technical report, Electrical Engineering Department, Imperial College, London (1988)."},{"key":"R3","unstructured":"G. Belov.Problems, models and algorithms in one- and two- dimensional cutting. Ph.D. Thesis, Dresden University (2003)."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"C.-L.S. Chen, S.M. Hart, and W.M. Tham. A simulated annealing heuristic for the one-dimensional cutting stock problem.Eur. J. Oper. Res.93(1996) 522\u2013535.","DOI":"10.1016\/0377-2217(95)00102-6"},{"key":"R5","unstructured":"S. Fekete and J. Schepers. New classes of fast lower bounds for bin packing problems.Math. Program.91(2001) 11\u201331."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"H. Foerster and G. Waescher. Pattern reduction in one-dimensional cutting stock problems.Int. J. Prod. Res.38(2000) 1657\u20131676.","DOI":"10.1080\/002075400188780"},{"key":"R7","unstructured":"T. Gau and G.Waescher. CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem.Eur. J. Oper. Res.84(1995) 572\u2013579."},{"key":"R8","unstructured":"P.C. Gilmore and R.E. Gomory. A linear programming approach to the cutting stock problem.Oper. Res.9(1961) 849\u2013859."},{"key":"R9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0377-2217(90)90355-F","volume":"44","author":"Goulimis","year":"1990","journal-title":"Eur. J. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/mnsc.17.12.B793","volume":"17","author":"Haessler","year":"1971","journal-title":"Manage. Sci."},{"key":"R11","unstructured":"R.W. Haessler. Controlling cutting pattern changes in one-dimensional trim problems.Oper. Res.23(1975) 483\u2013493."},{"key":"R12","first-page":"166","volume":"3","author":"Johnston","year":"1986","journal-title":"Asia-Pac. Oper. Res. J."},{"key":"R13","unstructured":"R.E. Johnston. Cutting patterns and cutter schedules.Asia-Pac. Oper. Res. J.4(1987) 3\u201314."},{"key":"R14","unstructured":"S. Martello and P. Toth,Knapsack Problems.Wiley, New York (1990)."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization. Wiley, New York (1988).","DOI":"10.1002\/9781118627372"},{"key":"R16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0377-0427(95)00009-7","volume":"64","author":"Teghem","year":"1995","journal-title":"J. Comput. Appl. Math."},{"key":"R17","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/S0377-2217(02)00239-4","volume":"146","author":"Umetani","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"R18","unstructured":"F. Vanderbeck. Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem.Oper. Res.48(2000) 915\u2013926."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008027\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T16:22:10Z","timestamp":1557850930000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":18,"journal-issue":{"issue":"4"},"alternative-id":["ro0804"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008027","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}