{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:02:51Z","timestamp":1777608171094,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s13675-019-00113-9","type":"journal-article","created":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T15:41:49Z","timestamp":1557502909000},"page":"265-297","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers"],"prefix":"10.1016","volume":"7","author":[{"given":"Fran\u00e7ois","family":"Clautiaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4862-2226","authenticated-orcid":false,"given":"Ruslan","family":"Sadykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quentin","family":"Viaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13675-019-00113-9_CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00291-002-0093-3","article-title":"A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems","volume":"24","author":"Alvarez-Valdes","year":"2002","journal-title":"OR Spectr"},{"issue":"1-2","key":"10.1007\/s13675-019-00113-9_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1111\/itor.12077","article-title":"Two-stage two-dimensional guillotine cutting stock problems with usable leftover","volume":"23","author":"Andrade","year":"2016","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"10.1007\/s13675-019-00113-9_CR3","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":"J Oper Res Soc"},{"issue":"5","key":"10.1007\/s13675-019-00113-9_CR4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","article-title":"Two-dimensional finite bin-packing algorithms","volume":"38","author":"Berkey","year":"1987","journal-title":"J Oper Res Soc"},{"issue":"1","key":"10.1007\/s13675-019-00113-9_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","article-title":"Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation","volume":"191","author":"Cintra","year":"2008","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-019-00113-9_CR6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.disopt.2018.02.003","article-title":"Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem","volume":"29","author":"Clautiaux","year":"2018","journal-title":"Discrete Optim"},{"issue":"1","key":"10.1007\/s13675-019-00113-9_CR7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.cor.2010.12.018","article-title":"Exact algorithms for the two-dimensional guillotine knapsack","volume":"39","author":"Dolatabadi","year":"2012","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-019-00113-9_CR8","doi-asserted-by":"crossref","unstructured":"Dusberger F, Raidl GR (2014) A variable neighborhood search using very large neighborhood structures for the 3-staged 2-dimensional cutting stock problem. In: Blesa MJ, Blum C, Vo\u00df S (eds) Hybrid metaheuristics: 9th International Workshop, HM 2014, Hamburg, Germany, 11\u201313 June 2014. Proceedings. Springer, Cham, pp 85\u201399","DOI":"10.1007\/978-3-319-07644-7_7"},{"key":"10.1007\/s13675-019-00113-9_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.endm.2014.11.018","article-title":"Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search","volume":"47","author":"Dusberger","year":"2015","journal-title":"Electron Notes Discrete Math"},{"issue":"1","key":"10.1007\/s13675-019-00113-9_CR10","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.cor.2012.07.016","article-title":"Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts","volume":"40","author":"Fleszar","year":"2013","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13675-019-00113-9_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.ejor.2011.10.018","article-title":"A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size","volume":"218","author":"Furini","year":"2012","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10.1007\/s13675-019-00113-9_CR12","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/ijoc.2016.0710","article-title":"Modeling two-dimensional guillotine cutting problems via integer programming","volume":"28","author":"Furini","year":"2016","journal-title":"INFORMS J Comput"},{"issue":"1","key":"10.1007\/s13675-019-00113-9_CR13","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","article-title":"Multistage cutting stock problems of two and more dimensions","volume":"13","author":"Gilmore","year":"1965","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13675-019-00113-9_CR14","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.ejor.2005.11.061","article-title":"A hybrid genetic algorithm for the two-dimensional single large object placement problem","volume":"183","author":"Hadjiconstantinou","year":"2007","journal-title":"Eur J Oper Res"},{"issue":"2-3","key":"10.1007\/s13675-019-00113-9_CR15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10107-002-0319-9","article-title":"Integer linear programming models for 2-staged two-dimensional knapsack problems","volume":"94","author":"Lodi","year":"2003","journal-title":"Math Program"},{"issue":"13","key":"10.1007\/s13675-019-00113-9_CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","article-title":"Recent advances on two-dimensional bin packing problems","volume":"123","author":"Lodi","year":"2002","journal-title":"Discrete Appl Math"},{"issue":"6","key":"10.1007\/s13675-019-00113-9_CR17","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/j.cor.2009.08.005","article-title":"Arc-flow model for the two-dimensional guillotine cutting stock problem","volume":"37","author":"Macedo","year":"2010","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13675-019-00113-9_CR18","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","article-title":"Exact solution of the two-dimensional finite bin packing problem","volume":"44","author":"Martello","year":"1998","journal-title":"Manag Sci"},{"issue":"1","key":"10.1007\/s13675-019-00113-9_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.38.1.127","article-title":"Polyhedral characterization of discrete dynamic programming","volume":"38","author":"Martin","year":"1990","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13675-019-00113-9_CR20","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/ijoc.2017.0784","article-title":"automation and combination of linear-programming based stabilization techniques in column generation","volume":"30","author":"Pessoa","year":"2018","journal-title":"INFORMS J Comput"},{"issue":"3","key":"10.1007\/s13675-019-00113-9_CR21","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.ejor.2007.10.020","article-title":"An agent-based approach to the two-dimensional guillotine bin packing problem","volume":"192","author":"Polyakovsky","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-019-00113-9_CR22","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","article-title":"Models and algorithms for three-stage two-dimensional bin packing","volume":"183","author":"Puchinger","year":"2007","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-019-00113-9_CR23","doi-asserted-by":"crossref","unstructured":"Puchinger J, Raidl GR, Koller G (2004) Solving a real-world glass cutting problem. In: Gottlieb J, Raidl GR (eds) Evolutionary computation in combinatorial optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, 5\u20137 April 2004. Proceedings. Springer, Berlin, pp 165\u2013176","DOI":"10.1007\/978-3-540-24652-7_17"},{"key":"10.1007\/s13675-019-00113-9_CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cor.2014.04.001","article-title":"An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems","volume":"50","author":"Russo","year":"2014","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-019-00113-9_CR25","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.2018.0822","article-title":"Primal heuristics for branch-and-price: the assets of diving methods","author":"Sadykov","year":"2019","journal-title":"INFORMS J Comput"},{"issue":"3","key":"10.1007\/s13675-019-00113-9_CR26","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2010.01.039","article-title":"An integer programming model for two-and three-stage two-dimensional cutting stock problems","volume":"205","author":"Silva","year":"2010","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-019-00113-9_CR27","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1018952112615","article-title":"Exact solution of bin-packing problems using column generation and branch-and-bound","volume":"86","author":"Val\u00e9rio de Carvalho","year":"1999","journal-title":"Ann Oper Res"},{"issue":"6","key":"10.1007\/s13675-019-00113-9_CR28","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/mnsc.47.6.864.9809","article-title":"A nested decomposition approach to a three-stage, two-dimensional cutting-stock problem","volume":"47","author":"Vanderbeck","year":"2001","journal-title":"Manag Sci"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-019-00113-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-019-00113-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001180?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001180?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-019-00113-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:47:29Z","timestamp":1761882449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S2192440621001180"],"URL":"https:\/\/doi.org\/10.1007\/s13675-019-00113-9","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-019-00113-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2019 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}