{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:47Z","timestamp":1740142487771,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T00:00:00Z","timestamp":1612483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T00:00:00Z","timestamp":1612483200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s40314-021-01421-w","type":"journal-article","created":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T14:02:18Z","timestamp":1612533738000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A heuristic for the problem of one-dimensional steel coil cutting"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0698-6360","authenticated-orcid":false,"given":"M. H.","family":"Pimenta-Zanon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Sakuray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. S. V.","family":"Hoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,5]]},"reference":[{"key":"1421_CR1","doi-asserted-by":"publisher","first-page":"106455","DOI":"10.1016\/j.cie.2020.106455","volume":"144","author":"YG Borges","year":"2020","unstructured":"Borges YG, Miyazawa FK, Schouery RC, Xavier EC (2020) Exact algorithms for class-constrained packing problems. Comput Ind Eng 144:106455. https:\/\/doi.org\/10.1016\/j.cie.2020.106455","journal-title":"Comput Ind Eng"},{"key":"1421_CR2","doi-asserted-by":"crossref","unstructured":"Caccetta L, Kulanoot A (2001a) Algorithms for Some Hard Knapsack Problems. In: Yang X, Teo KL, Caccetta L (eds) Optimization Methods and Applications. Applied Optimization, vol 52. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/978-1-4757-3333-4_11","DOI":"10.1007\/978-1-4757-3333-4_11"},{"key":"1421_CR3","doi-asserted-by":"publisher","unstructured":"Caccetta L, Kulanoot A (2001b) Computational aspects of hard knapsack problems. Nonlinear Anal 47(8):5547\u20135558. https:\/\/doi.org\/10.1016\/S0362-546X(01)00658-7. ISSN 0362-546X","DOI":"10.1016\/S0362-546X(01)00658-7"},{"issue":"1","key":"1421_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"G Cintra","year":"2008","unstructured":"Cintra G, Miyazawa F, Wakabayashi Y, Xavier E (2008) Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur J Oper Res 191(1):61\u201385. https:\/\/doi.org\/10.1016\/j.ejor.2007.08.007","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1421_CR5","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete-variable extremum problems. Oper Res 5(2):266\u2013288","journal-title":"Oper Res"},{"key":"1421_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.cie.2017.01.015","volume":"105","author":"TA de Queiroz","year":"2017","unstructured":"de Queiroz TA, Hokama PHDB, Schouery RCS, Miyazawa FK (2017) Two-dimensional disjunctively constrained knapsack problem: Heuristic and exact approaches. Comput Ind Eng 105:313\u2013328. https:\/\/doi.org\/10.1016\/j.cie.2017.01.015","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1421_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255(1):1\u201320. https:\/\/doi.org\/10.1016\/j.ejor.2016.04.030","journal-title":"Eur J Oper Res"},{"issue":"34\u201336","key":"1421_CR8","doi-asserted-by":"publisher","first-page":"3073","DOI":"10.1016\/j.tcs.2010.04.037","volume":"411","author":"L Epstein","year":"2010","unstructured":"Epstein L, Imreh C, Levin A (2010) Class constrained bin packing revisited. Theor Comput Sci 411(34\u201336):3073\u20133089. https:\/\/doi.org\/10.1016\/j.tcs.2010.04.037","journal-title":"Theor Comput Sci"},{"key":"1421_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0377-2217(90)90354-E","volume":"44","author":"JS Ferreira","year":"1990","unstructured":"Ferreira JS, Neves M, Castro P (1990) A two-phase roll cutting problem. Eur J Oper Res 44:185\u2013196","journal-title":"Eur J Oper Res"},{"key":"1421_CR10","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem-part ii. Oper Res 11:863\u2013888","journal-title":"Oper Res"},{"issue":"1","key":"1421_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore PC, Gomory RE (1965) Multistage cutting stock problems of two and more dimensions. Oper Res 13(1):94\u2013120. https:\/\/doi.org\/10.1287\/opre.13.1.94","journal-title":"Oper Res"},{"issue":"2","key":"1421_CR12","first-page":"145","volume":"7","author":"R Haessler","year":"1979","unstructured":"Haessler R (1979) Solving the two-stage cutting-stock problem. Int J Manag Sci 7(2):145\u2013151","journal-title":"Int J Manag Sci"},{"key":"1421_CR13","unstructured":"Hoto RSV (2001) O problema da mochila compartimentada aplicado no corte de bobinas de a\u00e7o. Ph.D. Thesis, UFRJ, Rio de Janeiro"},{"issue":"4","key":"1421_CR14","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1504\/ijor.2017.10003466","volume":"28","author":"RS Hoto","year":"2017","unstructured":"Hoto RS, Bressan GM (2017) New solutions to the constrained compartmentalised knapsack problem. Int J Oper Res 28(4):472. https:\/\/doi.org\/10.1504\/ijor.2017.10003466","journal-title":"Int J Oper Res"},{"issue":"1","key":"1421_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1590\/s0101-74382003000100013","volume":"23","author":"R Hoto","year":"2003","unstructured":"Hoto R, Maculan N, Marques F, Arenales M (2003) Um problema de corte com padr\u00f5es compartimentados. Pesq Oper 23(1):169\u2013187. https:\/\/doi.org\/10.1590\/s0101-74382003000100013","journal-title":"Pesq Oper"},{"key":"1421_CR16","unstructured":"Hoto R, Fenato A, Yannasse H, Maculan N, Spolador F (2006) Uma nova abordagem para o problema da mochila compartimentada. In: Anal do XXXVIII Simp\u00f3sio brasileiro de Pesquisa Operacional http:\/\/www.din.uem.br\/sbpo\/sbpo2006\/pdf\/arq0041.pdf"},{"key":"1421_CR17","volume-title":"Sobre a n\u00e3o-linearidade do problema da mochila compartimentada","author":"O Inarejos","year":"2015","unstructured":"Inarejos O (2015) Sobre a n\u00e3o-linearidade do problema da mochila compartimentada. Mathesis, UEL, Londrina"},{"issue":"1","key":"1421_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/itor.12490","volume":"00","author":"O Inarejos","year":"2017","unstructured":"Inarejos O, Hoto R, Maculan N (2017) A integer linear optimization model to the compartimentalized knapsack problem. Int Trans Oper Res 00(1):1\u201320. https:\/\/doi.org\/10.1111\/itor.12490","journal-title":"Int Trans Oper Res"},{"key":"1421_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer-Verlag GmbH, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-24777-7"},{"key":"1421_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.endm.2017.03.006","volume":"58","author":"Y Kochetov","year":"2017","unstructured":"Kochetov Y, Kondakov A (2017) VNS matheuristic for a bin packing problem with a color constraint. Electron Notes Discrete Math 58:39\u201346. https:\/\/doi.org\/10.1016\/j.endm.2017.03.006","journal-title":"Electron Notes Discrete Math"},{"key":"1421_CR21","unstructured":"Leao A A de S, Santos MOAMN, Hoto RSV (2008) Uma heur\u00edstica para o problema da mochila compartimentada. In: XL SBPO"},{"key":"1421_CR22","unstructured":"Le\u00e3o AAdS (2009) Gera\u00e7\u00e3o de colunas para problemas de cortes em duas fases. mathesis, ICMC-USP, S\u00e3o Carlos"},{"key":"1421_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.4028\/www.scientific.net\/amm.311.123","volume":"311","author":"TD Lin","year":"2013","unstructured":"Lin TD, Hsu CC, Hsu LF (2013) Optimization by ant colony hybrid local search for online class constrained bin packing problem. Appl Mech Mater 311:123\u2013128. https:\/\/doi.org\/10.4028\/www.scientific.net\/amm.311.123","journal-title":"Appl Mech Mater"},{"issue":"3","key":"1421_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1590\/S0101-74382002000300001","volume":"22","author":"FP Marques","year":"2002","unstructured":"Marques FP, Arenales MN (2002) O problema da mochila compartimentada e aplica\u00e7\u00f5es. Pesq Oper 22(3):285\u2013304","journal-title":"Pesq Oper"},{"issue":"7","key":"1421_CR25","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/j.cor.2005.08.011","volume":"34","author":"F Marques","year":"2007","unstructured":"Marques F, Arenales MN (2007) The constrained compartmentalised knapsack problem. Comput Oper Res 34(7):2109\u20132129. https:\/\/doi.org\/10.1016\/j.cor.2005.08.011","journal-title":"Comput Oper Res"},{"key":"1421_CR26","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. John Wiley & Sons Inc, New York"},{"key":"1421_CR27","unstructured":"Pisinger D (1995) A minimal algorithm for the bounded knapsack problem. In: Computer science, pp 95\u2013109"},{"issue":"5","key":"1421_CR28","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1111\/itor.12639","volume":"26","author":"JJ Quiroga-Orozco","year":"2018","unstructured":"Quiroga-Orozco JJ, de Carvalho JMV, Hoto RSV (2018) A strong integer linear optimization model to the compartmentalized knapsack problem. Int Trans Oper Res 26(5):1633\u20131654. https:\/\/doi.org\/10.1111\/itor.12639","journal-title":"Int Trans Oper Res"},{"key":"1421_CR29","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/0377-2217(95)00024-K","volume":"84","author":"J Valerio de Carvalho","year":"1995","unstructured":"Valerio de Carvalho J, Rodrigues A (1995) An lp-based approach to a two-stage cutting-stock problem. Eur J Oper Res 84:580\u2013589","journal-title":"Eur J Oper Res"},{"issue":"9","key":"1421_CR30","doi-asserted-by":"publisher","first-page":"11143","DOI":"10.1016\/S0305-0548(00)00111-8","volume":"29","author":"E Zak","year":"2002","unstructured":"Zak E (2002) Row and column generation technique for a multistage cutting stock problem. Comput Oper Res 29(9):11143\u20131156. https:\/\/doi.org\/10.1016\/S0305-0548(00)00111-8","journal-title":"Comput Oper Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01421-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-021-01421-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01421-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T21:06:29Z","timestamp":1615669589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-021-01421-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,5]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1421"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01421-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,2,5]]},"assertion":[{"value":"26 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"39"}}