{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T10:11:47Z","timestamp":1768644707886,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T00:00:00Z","timestamp":1527120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10100-018-0551-x","type":"journal-article","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T05:24:25Z","timestamp":1527139465000},"page":"329-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An EDA for the 2D knapsack problem with guillotine constraint"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0503-6630","authenticated-orcid":false,"given":"Istv\u00e1n","family":"Borgulya","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,24]]},"reference":[{"key":"551_CR1","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1016\/S0305-0548(00)00095-2","volume":"29","author":"R Alvarez-Valdes","year":"2002","unstructured":"Alvarez-Valdes R, Paraj\u00f3n A, Tamarit JM (2002) A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput Oper Res 29:925\u2013947","journal-title":"Comput Oper Res"},{"key":"551_CR2","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1057\/palgrave.jors.2601829","volume":"56","author":"R Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit JM (2005) A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J Oper Res Soc 56:414\u2013425","journal-title":"J Oper Res Soc"},{"key":"551_CR3","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/0377-2217(95)00026-M","volume":"84","author":"M Arenales","year":"1995","unstructured":"Arenales M, Morabito R (1995) An AND\/OR-graph approach to the solution of two dimensional non-guillotine cutting problems. Eur J Oper Res 84:599\u2013617","journal-title":"Eur J Oper Res"},{"key":"551_CR4","unstructured":"Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA"},{"key":"551_CR5","unstructured":"Baluja S, Davies S (1997) Using optimal dependency-trees for combinatorial optimization: learning the structure of the search space. In: Proceedings of the international conference on machine learning, pp 30\u201338"},{"key":"551_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1057\/jors.1985.51","volume":"36","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985a) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297\u2013306","journal-title":"J Oper Res Soc"},{"key":"551_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985b) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49\u201364","journal-title":"Oper Res"},{"key":"551_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0377-2217(03)00139-5","volume":"156","author":"JE Beasley","year":"2004","unstructured":"Beasley JE (2004) A population heuristic for constrained two-dimensional non-guillotine cutting. Eur J Oper Res 156:601\u2013627","journal-title":"Eur J Oper Res"},{"key":"551_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/3-540-34783-6_55","volume-title":"Computational intelligence, theory and applications, advances in soft computing","author":"I Borgulya","year":"2006","unstructured":"Borgulya I (2006) An evolutionary algorithm for the biobjective QAP. In: Reusch B (ed) Computational intelligence, theory and applications, advances in soft computing. Springer, Berlin, pp 577\u2013586"},{"issue":"4","key":"551_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.2498\/cit.1002422","volume":"22","author":"I Borgulya","year":"2014","unstructured":"Borgulya I (2014) A parallel hyper-heuristic approach for the two-dimensional rectangular strip-packing problem. J Comput Inf Technol 22(4):251\u2013266","journal-title":"J Comput Inf Technol"},{"key":"551_CR11","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A Bortfeldt","year":"2006","unstructured":"Bortfeldt A (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur J Oper Res 172:814\u2013837","journal-title":"Eur J Oper Res"},{"key":"551_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-012-1084-7","volume":"196","author":"A Bortfeldt","year":"2012","unstructured":"Bortfeldt A, Jungmann S (2012) A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. Ann Oper Res 196:53\u201371","journal-title":"Ann Oper Res"},{"key":"551_CR13","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1111\/j.1475-3995.2009.00701.x","volume":"16","author":"A Bortfeldt","year":"2009","unstructured":"Bortfeldt A, Winter T (2009) A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. Int Trans Oper Res 16:685\u2013713","journal-title":"Int Trans Oper Res"},{"key":"551_CR15","first-page":"401","volume-title":"Ideal 2013","author":"Y Cai","year":"2013","unstructured":"Cai Y, Chen H, Yu R, Shao H, Li Y (2013) An estimation of distribution algorithm for the 3D bin packing problem with various bin sizes. Ideal 2013, vol 8206, pp 401\u2013408"},{"key":"551_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara A, Monaci M (2004) On the 2-dimensional knapsack problem. Oper Res Lett 32:5\u201314","journal-title":"Oper Res Lett"},{"key":"551_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10589-007-9103-3","volume":"41","author":"Y Chen","year":"2008","unstructured":"Chen Y (2008) A recursive algorithm for constrained two-dimensional cutting problems. Comput Optim Appl 41:337\u2013348","journal-title":"Comput Optim Appl"},{"issue":"1","key":"551_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25(1):30\u201344","journal-title":"Oper Res"},{"key":"551_CR19","doi-asserted-by":"crossref","unstructured":"Cintra G, Wakabayashi Y (2004) Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. In: Ribeiro CC, Martins SL (eds) WEA 2004, LNCS 3059, pp 175\u2013190","DOI":"10.1007\/978-3-540-24838-5_13"},{"key":"551_CR20","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1016\/j.cor.2012.11.020","volume":"40","author":"Y Cui","year":"2013","unstructured":"Cui Y, Yang L, Chen Q (2013) Heuristic for the rectangular strip packing problem with rotation of items. Comput Oper Res 40:1094\u20131099","journal-title":"Comput Oper Res"},{"key":"551_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1111\/j.1475-3995.2000.tb00194.x","volume":"7","author":"V Cung","year":"2000","unstructured":"Cung V, Hifi M, Le Cun B (2000) Constrained two-dimensional guillotine cutting stock problems: a best-first branch-and-bound algorithm. Int Trans Oper Res 7:185\u2013201","journal-title":"Int Trans Oper Res"},{"key":"551_CR22","unstructured":"De Bonet JS, Isbell CL, Viola JrP (1996) MIMIC: finding optima by estimating probability densities advances in neural information processing systems 9. NIPS, Denver, CO, USA, 2\u20135 Dec 1996"},{"key":"551_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.cor.2010.12.018","volume":"39","author":"M Dolatabadi","year":"2012","unstructured":"Dolatabadi M, Lodi A, Monaci M (2012) Exact algorithms for the two-dimensional guillotine knapsack. Comput Oper Res 39:48\u201353","journal-title":"Comput Oper Res"},{"issue":"4","key":"551_CR24","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1016\/j.cor.2007.12.004","volume":"36","author":"J Egeblad","year":"2009","unstructured":"Egeblad J, Pisinger D (2009) Heuristic approaches for the two- and three-dimensional knapsack packing problem. Comput Oper Res 36(4):1026\u20131049","journal-title":"Comput Oper Res"},{"key":"551_CR25","first-page":"332","volume-title":"Second symposium on artificial intelligence (CIMAF-99)","author":"R Etxeberria","year":"1999","unstructured":"Etxeberria R, Larranaga P (1999) Global optimization using Bayesian networks. In: Rodriguez MR, Ortiz S, Hermida RS (eds) Second symposium on artificial intelligence (CIMAF-99). Habana, Cuba, pp 332\u2013339"},{"key":"551_CR26","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1057\/palgrave.jors.2600638","volume":"49","author":"D Fayard","year":"1998","unstructured":"Fayard D, Hifi M, Zissimopoulos V (1998) An efficient approach for large-scale two-dimensional guillotine cutting stock problems. J Oper Res Soc 49:1270\u20131277","journal-title":"J Oper Res Soc"},{"key":"551_CR27","unstructured":"Fekete SP, Schepers J (1997) On more-dimensional packing III: Exact algorithms. Technical Report ZPR97-290, Mathematisches Institut, Universit\u00e4t zu K\u00f6ln"},{"key":"551_CR28","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"SP Fekete","year":"2007","unstructured":"Fekete SP, Schepers J, van der Veen JC (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55:569\u2013587","journal-title":"Oper Res"},{"issue":"1","key":"551_CR29","first-page":"104","volume":"9","author":"S Gao","year":"2014","unstructured":"Gao S, Qiu L, Cungen C (2014) Estimation of distribution algorithms for knapsack problem. J Softw 9(1):104\u2013110","journal-title":"J Softw"},{"key":"551_CR30","unstructured":"Gon\u00e7alves JF, Resende MGC (2006) A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem. AT&T Labs Research Technical report TD-&UNQN6"},{"key":"551_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou E, Christofides N (1995) An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur J Oper Res 83:39\u201356","journal-title":"Eur J Oper Res"},{"key":"551_CR32","unstructured":"Harik G (1999) Linkage learning via probabilistic modeling in the ECGA. IlliGAL technical report Illinois Genetic Algorithms Laboratory Urbana"},{"issue":"8","key":"551_CR33","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/S0305-0548(96)00095-0","volume":"24","author":"M Hifi","year":"1997","unstructured":"Hifi M (1997) An improvement of Viswanathan and Bagchi\u2019s exact algorithm for constrained two-dimensional cutting stock. Comput Oper Res 24(8):727\u2013736","journal-title":"Comput Oper Res"},{"key":"551_CR34","first-page":"130","volume":"4","author":"KK Lai","year":"1997","unstructured":"Lai KK, Chan JWM (1997) An evolutionary algorithm for the rectangular cutting stock problem. Int J Ind Eng 4:130\u2013139","journal-title":"Int J Ind Eng"},{"issue":"2012","key":"551_CR35","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cor.2010.10.022","volume":"39","author":"SCH Leung","year":"2012","unstructured":"Leung SCH, Zhang D, Zhou C, Wu T (2012) A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput Oper Res 39(2012):64\u201373","journal-title":"Comput Oper Res"},{"key":"551_CR36","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/0377-2217(95)00128-X","volume":"94","author":"R Morabito","year":"1996","unstructured":"Morabito R, Arenales M (1996) Staged and constrained two-dimensional guillotine cutting problems: an AND\/OR- graph approach. Eur J Oper Res 94:548\u2013560","journal-title":"Eur J Oper Res"},{"issue":"4","key":"551_CR37","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein H, Mahnig T (1999) FDA\u2014a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evol Comput 7(4):353\u2013376","journal-title":"Evol Comput"},{"key":"551_CR38","unstructured":"Ocenasek J (2002) Parallel estimation of distribution algorithms. Ph.D. thesis, Brno University of Technology"},{"key":"551_CR39","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0377-2217(90)90361-E","volume":"44","author":"JF Oliveira","year":"1990","unstructured":"Oliveira JF, Ferreira JS (1990) An improved version of Wang\u2019s algorithm for two-dimensional cutting problems. Eur J Oper Res 44:256\u2013266","journal-title":"Eur J Oper Res"},{"key":"551_CR40","volume-title":"Evolutionary algorithms in management applications","author":"V Parada","year":"1995","unstructured":"Parada V, Munoz R, Gomes A (1995) A hybrid genetic algorithm for the two-dimensional cutting problem. In: Biethahn J, Nissen V (eds) Evolutionary algorithms in management applications. Springer, Berlin"},{"key":"551_CR41","unstructured":"Pelikan M, Goldberg DE, Cant\u00fa-Paz E (1999) BOA: the Bayesian optimization algorithm. In: Proceedings of the genetic and evolutionary computation conference (GECCO-99), pp 525\u2013532"},{"key":"551_CR42","unstructured":"Pelikan M, Hauschild MW, Lobo FG (2012) Introduction to estimation of distribution algorithms medal report No. 2012003 University of Missouri-St. Louis"},{"key":"551_CR43","unstructured":"Pham N (2011) Investigations of constructive approaches for examination timetabling and 3D-strip packing. Ph.D. thesis, University of Nottingham"},{"issue":"1","key":"551_CR44","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0360-8352(89)90013-2","volume":"16","author":"FJ Vasco","year":"1989","unstructured":"Vasco FJ (1989) A computational improvement to Wangs\u2019s two-dimensional cutting stock algorithm. Comput Ind Eng 16(1):109\u2013115","journal-title":"Comput Ind Eng"},{"issue":"4","key":"551_CR45","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/opre.41.4.768","volume":"41","author":"KV Viswanathan","year":"1993","unstructured":"Viswanathan KV, Bagchi A (1993) Best-first search methods for constrained two-dimensional cutting stock problems. Oper Res 41(4):768\u2013776","journal-title":"Oper Res"},{"key":"551_CR46","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"PY Wang","year":"1983","unstructured":"Wang PY (1983) Two algorithms for constrained two-dimensional cutting stock problems. Oper Res 31:573\u2013586","journal-title":"Oper Res"},{"key":"551_CR47","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2014.10.004","volume":"242","author":"L Wei","year":"2015","unstructured":"Wei L, Lim A (2015) A bidirectional building approach for the 2D constrained guillotine knapsack packing problem. Eur J Oper Res 242:63\u201371","journal-title":"Eur J Oper Res"},{"key":"551_CR48","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ejor.2014.04.020","volume":"239","author":"L Wei","year":"2014","unstructured":"Wei L, Tian T, Zhu W, Lim A (2014) A block-based layer building approach for the 2D guillotine strip packing problem. Eur J Oper Res 239:58\u201369","journal-title":"Eur J Oper Res"},{"key":"551_CR49","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0377-2217(02)00129-7","volume":"41","author":"YL Wu","year":"2002","unstructured":"Wu YL, Huang W, Lau SC, Wong CK, Young GH (2002) An effective quasi-human based heuristic for solving the rectangle packing problem. Eur J Oper Res 41:341\u2013358","journal-title":"Eur J Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0551-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0551-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0551-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:06:58Z","timestamp":1558638418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0551-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,24]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["551"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0551-x","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,24]]},"assertion":[{"value":"24 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}