{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T06:08:34Z","timestamp":1775887714920,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T00:00:00Z","timestamp":1644624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T00:00:00Z","timestamp":1644624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2020\/00747-2"],"award-info":[{"award-number":["2020\/00747-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["04144\/2019-3]"],"award-info":[{"award-number":["04144\/2019-3]"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-022-00848-z","type":"journal-article","created":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T13:02:41Z","timestamp":1644670961000},"page":"557-582","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6722-7571","authenticated-orcid":false,"given":"Mateus","family":"Martin","sequence":"first","affiliation":[]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[]},{"given":"Luiz Ledu\u00edno","family":"Salles-Neto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,12]]},"reference":[{"key":"848_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1057\/s41274-017-0214-7","volume":"69","author":"A Aliano Filho","year":"2018","unstructured":"Aliano Filho A, Moretti AC, Pato MV (2018) A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem. J Oper Res Soc 69:91\u2013107. https:\/\/doi.org\/10.1057\/s41274-017-0214-7","journal-title":"J Oper Res Soc"},{"key":"848_CR2","doi-asserted-by":"publisher","first-page":"2944","DOI":"10.1016\/j.cor.2009.01.008","volume":"36","author":"C Alves","year":"2009","unstructured":"Alves C, Macedo R, Val\u00e9rio de Carvalho J (2009) New lower bounds based on column generation and constraint programming for the pattern minimization problem. Comput Oper Res 36:2944\u20132954. https:\/\/doi.org\/10.1016\/j.cor.2009.01.008","journal-title":"Comput Oper Res"},{"key":"848_CR3","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1051\/ro:2008027","volume":"42","author":"C Alves","year":"2008","unstructured":"Alves C, Val\u00e9rio De Carvalho JM (2008) A branch-and-price-and-cut algorithm for the pattern minimization problem. RAIRO Oper Res 42:435\u2013453. https:\/\/doi.org\/10.1051\/ro:2008027","journal-title":"RAIRO Oper Res"},{"key":"848_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1590\/0101-7438.2014.034.02.0165","volume":"34","author":"SA Araujo","year":"2014","unstructured":"Araujo SA, Poldi KC, Smith J (2014) A genetic algorithm for the one-dimensional cutting stock problem with setups. Pesqui Oper 34:165\u2013187. https:\/\/doi.org\/10.1590\/0101-7438.2014.034.02.0165","journal-title":"Pesqui Oper"},{"key":"848_CR5","unstructured":"Belov G, Scheithauer G (2003) The number of setups (different patterns) in one-dimensional stock cutting. Technical Report Institute for Numerical Mathematics, Dresden University, MATH-NM-15-2003"},{"key":"848_CR6","doi-asserted-by":"publisher","unstructured":"Cerqueira GR, Aguiar SS, Marques M (2021) Modified Greedy Heuristic for the one-dimensional cutting stock problem. J Comb Optim. https:\/\/doi.org\/10.1007\/s10878-021-00695-4","DOI":"10.1007\/s10878-021-00695-4"},{"key":"848_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1080\/10556780903420531","volume":"26","author":"Y Cui","year":"2011","unstructured":"Cui Y, Liu Z (2011) C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction. Optim Methods Softw 26:155\u2013167. https:\/\/doi.org\/10.1080\/10556780903420531","journal-title":"Optim Methods Softw"},{"key":"848_CR8","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2014.12.015","volume":"243","author":"Y Cui","year":"2015","unstructured":"Cui Y, Zhong C, Yao Y (2015) Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost. Eur J Oper Res 243:540\u2013546. https:\/\/doi.org\/10.1016\/j.ejor.2014.12.015","journal-title":"Eur J Oper Res"},{"key":"848_CR9","unstructured":"Diegel A, Chetty M, Van\u00a0Schalkwyck S, Naidoo S (1993) Setup combining in the trim loss problem-3-to-2 & 2-to-1. Technical Report Business Administration, University of Natal, Durban, First Draft"},{"key":"848_CR10","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1080\/002075400188780","volume":"38","author":"H Foerster","year":"2000","unstructured":"Foerster H, W\u00e4scher G (2000) Pattern reduction in one-dimensional cutting stock problems. Int J Prod Res 38:1657\u20131676. https:\/\/doi.org\/10.1080\/002075400188780","journal-title":"Int J Prod Res"},{"key":"848_CR11","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co, New York"},{"key":"848_CR12","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T Gau","year":"1995","unstructured":"Gau T, W\u00e4scher G (1995) CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. Eur J Oper Res 84:572\u2013579. https:\/\/doi.org\/10.1016\/0377-2217(95)00023-J","journal-title":"Eur J Oper Res"},{"key":"848_CR13","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9:849\u2013859. https:\/\/doi.org\/10.1287\/opre.9.6.849","journal-title":"Oper Res"},{"key":"848_CR14","first-page":"473","volume":"11","author":"RR Golfeto","year":"2009","unstructured":"Golfeto RR, Moretti AC, Neto LLdS (2009) A genetic symbiotic algorithm applied to cutting stock problem with multiple objectives. Adv Model Optim 11:473\u2013501","journal-title":"Adv Model Optim"},{"key":"848_CR15","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/opre.23.3.483","volume":"23","author":"RW Haessler","year":"1975","unstructured":"Haessler RW (1975) Controlling cutting pattern changes in one-dimensional trim problems. Oper Res 23:483\u2013493. https:\/\/doi.org\/10.1287\/opre.23.3.483","journal-title":"Oper Res"},{"key":"848_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0098-1354(96)00031-2","volume":"20","author":"I Harjunkoski","year":"1996","unstructured":"Harjunkoski I, Westerlund T, Isaksson J, Skrifvars H (1996) Different formulations for solving trim loss problems in a paper-converting mill with ILP. Comput Chem Eng 20:121\u2013126. https:\/\/doi.org\/10.1016\/0098-1354(96)00031-2","journal-title":"Comput Chem Eng"},{"key":"848_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1590\/S0101-74382013000200001","volume":"33","author":"S Henn","year":"2013","unstructured":"Henn S, W\u00e4scher G (2013) Extensions of cutting problems: setups. Pesqui Oper 33:133\u2013162. https:\/\/doi.org\/10.1590\/S0101-74382013000200001","journal-title":"Pesqui Oper"},{"key":"848_CR18","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/S0377-2217(02)00704-X","volume":"153","author":"RE Johnston","year":"2004","unstructured":"Johnston RE, Sadinlija E (2004) A new model for complete solutions to one-dimensional cutting stock problems. Eur J Oper Res 153:176\u2013183. https:\/\/doi.org\/10.1016\/S0377-2217(02)00704-X","journal-title":"Eur J Oper Res"},{"key":"848_CR19","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"LV Kantorovich","year":"1960","unstructured":"Kantorovich LV (1960) Mathematical methods of organizing and planning production. Manage Sci 6:366\u2013422. https:\/\/doi.org\/10.1287\/mnsc.6.4.366","journal-title":"Manage Sci"},{"key":"848_CR20","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1016\/j.cor.2005.09.007","volume":"34","author":"J Lee","year":"2007","unstructured":"Lee J (2007) In situ column generation for a cutting-stock problem. Comput Oper Res 34:2345\u20132358. https:\/\/doi.org\/10.1016\/j.cor.2005.09.007","journal-title":"Comput Oper Res"},{"key":"848_CR21","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.cor.2019.05.013","volume":"109","author":"N Ma","year":"2019","unstructured":"Ma N, Liu Y, Zhou Z (2019) Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost. Comput Oper Res 109:218\u2013229. https:\/\/doi.org\/10.1016\/j.cor.2019.05.013","journal-title":"Comput Oper Res"},{"key":"848_CR22","doi-asserted-by":"publisher","unstructured":"Martin M, Moretti A, Gomes-Ruggiero M, Neto LS (2018) Modification of Haessler\u2019s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost. Producao. https:\/\/doi.org\/10.1590\/0103-6513.20170105","DOI":"10.1590\/0103-6513.20170105"},{"key":"848_CR23","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0166-218X(99)00112-2","volume":"98","author":"C McDiarmid","year":"1999","unstructured":"McDiarmid C (1999) Pattern minimisation in cutting stock problems. Discrete Appl Math 98:121\u2013130. https:\/\/doi.org\/10.1016\/S0166-218X(99)00112-2","journal-title":"Discrete Appl Math"},{"key":"848_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.cor.2012.06.007","volume":"40","author":"A Mobasher","year":"2013","unstructured":"Mobasher A, Ekici A (2013) Solution approaches for the cutting stock problem with setup cost. Comput Oper Res 40:225\u2013235. https:\/\/doi.org\/10.1016\/j.cor.2012.06.007","journal-title":"Comput Oper Res"},{"key":"848_CR25","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/S0377-2217(97)00404-9","volume":"112","author":"C Nitsche","year":"1999","unstructured":"Nitsche C, Scheithauer G, Terno J (1999) Tighter relaxations for the cutting stock problem. Eur J Oper Res 112:654\u2013663. https:\/\/doi.org\/10.1016\/S0377-2217(97)00404-9","journal-title":"Eur J Oper Res"},{"key":"848_CR26","doi-asserted-by":"publisher","unstructured":"Scheithauer G (2018) Introduction to cutting and packing optimization: problems, modeling approaches, solution methods. In: International series in operations research and management science. Springer. https:\/\/doi.org\/10.1007\/978-3-319-64143-0","DOI":"10.1007\/978-3-319-64143-0"},{"key":"848_CR27","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/S0377-2217(02)00239-4","volume":"146","author":"S Umetani","year":"2003","unstructured":"Umetani S, Yagiura M, Ibaraki T (2003) One-dimensional cutting stock problem to minimize the number of different patterns. Eur J Oper Res 146:388\u2013402. https:\/\/doi.org\/10.1016\/S0377-2217(02)00239-4","journal-title":"Eur J Oper Res"},{"key":"848_CR28","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10852-005-9031-0","volume":"5","author":"S Umetani","year":"2006","unstructured":"Umetani S, Yagiura M, Ibaraki T (2006) One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. J Math Model Algorithms 5:43\u201364. https:\/\/doi.org\/10.1007\/s10852-005-9031-0","journal-title":"J Math Model Algorithms"},{"key":"848_CR29","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0377-2217(95)00198-0","volume":"95","author":"R Vahrenkamp","year":"1996","unstructured":"Vahrenkamp R (1996) Random search in the one-dimensional cutting stock problem. Eur J Oper Res 95:191\u2013200. https:\/\/doi.org\/10.1016\/0377-2217(95)00198-0","journal-title":"Eur J Oper Res"},{"key":"848_CR30","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/a:1018952112615","volume":"86","author":"JM Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho JM (1999) Exact solution of cutting stock problems using column generation and branch-and-bound. Ann Oper Res 86:629\u2013659. https:\/\/doi.org\/10.1023\/a:1018952112615","journal-title":"Ann Oper Res"},{"key":"848_CR31","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"JM Val\u00e9rio de Carvalho","year":"2002","unstructured":"Val\u00e9rio de Carvalho JM (2002) LP models for bin packing and cutting stock problems. Eur J Oper Res 141:253\u2013273. https:\/\/doi.org\/10.1016\/S0377-2217(02)00124-8","journal-title":"Eur J Oper Res"},{"key":"848_CR32","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck F (2000) Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper Res 48:915\u2013926. https:\/\/doi.org\/10.1287\/opre.48.6.915.12391","journal-title":"Oper Res"},{"key":"848_CR33","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ejor.2020.03.060","volume":"286","author":"D Wang","year":"2020","unstructured":"Wang D, Xiao F, Zhou L, Liang Z (2020) Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation. Eur J Oper Res 286:547\u2013563. https:\/\/doi.org\/10.1016\/j.ejor.2020.03.060","journal-title":"Eur J Oper Res"},{"key":"848_CR34","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109\u20131130. https:\/\/doi.org\/10.1016\/j.ejor.2005.12.047","journal-title":"Eur J Oper Res"},{"key":"848_CR35","doi-asserted-by":"publisher","first-page":"2744","DOI":"10.1016\/j.cor.2005.02.026","volume":"33","author":"HH Yanasse","year":"2006","unstructured":"Yanasse HH, Limeira MS (2006) A hybrid heuristic to reduce the number of different patterns in cutting stock problems. Comput Oper Res 33:2744\u20132756. https:\/\/doi.org\/10.1016\/j.cor.2005.02.026","journal-title":"Comput Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00848-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00848-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00848-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:32:11Z","timestamp":1659079931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00848-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,12]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["848"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00848-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,12]]},"assertion":[{"value":"15 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}