{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:52:37Z","timestamp":1725936757931},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319734408"},{"type":"electronic","value":"9783319734415"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73441-5_39","type":"book-chapter","created":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T05:42:23Z","timestamp":1514871743000},"page":"366-373","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["2D Optimal Packing with Population Based Algorithms"],"prefix":"10.1007","author":[{"given":"Desislava","family":"Koleva","sequence":"first","affiliation":[]},{"given":"Maria","family":"Barova","sequence":"additional","affiliation":[]},{"given":"Petar","family":"Tomov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Evtimov, G., Fidanova, S.: Ant colony optimization algorithm for 1D cutting stock problem. In: Proceedings of 11th Annual Meeting of the Bulgarian Section of SIAM, Sofia, Bulgaria, pp. 24\u201325. Fastumprint (2016)","DOI":"10.1007\/978-3-319-65530-7_3"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Evtimov, G.: Project 2: optimal cutting problem. In: 120th European Study Group with Industry, Sofia, Bulgaria. Stobet Ltd. (2016)","DOI":"10.1007\/978-3-319-65530-7_4"},{"key":"39_CR3","unstructured":"Avdzhieva, A., Balabanov, T., Evtimov, G., Kirova, D., Kostadinov, H., Tsachev, T., Zhelezova, S., Zlateva N.: Optimal cutting problem. In: Problems and Final Reports of 113th European Study Group with Industry, Sofia, Bulgaria, pp. 49\u201361. Fastumprint (2015)"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cor.2015.04.024","volume":"63","author":"S Martelloa","year":"2015","unstructured":"Martelloa, S., Monacib, M.: Models and algorithms for packing rectangles into the smallest square. Comput. Oper. Res. 63, 161\u2013171 (2015)","journal-title":"Comput. Oper. Res."},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.ejor.2007.09.012","volume":"192","author":"M Teresa Costa","year":"2009","unstructured":"Teresa Costa, M., Miguel Gomes, A., Oliveira, J.: Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet. Eur. J. Oper. Res. 192, 29\u201340 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"K Dowsland","year":"1992","unstructured":"Dowsland, K., Dowsland, W.: Packing problems. Eur. J. Oper. Res. 56, 2\u201314 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-58484-6_252","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN III","author":"AE Eiben","year":"1994","unstructured":"Eiben, A.E., Rau\u00e9, P.-E., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 78\u201387. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58484-6_252"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/11553090_41","volume-title":"Advances in Artificial Life","author":"C-K Ting","year":"2005","unstructured":"Ting, C.-K.: On the mean convergence time of multi-parent genetic algorithms without selection. In: Capcarr\u00e8re, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds.) ECAL 2005. LNCS (LNAI), vol. 3630, pp. 403\u2013412. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11553090_41"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-15585-2_6","volume-title":"Numerical Methods and Applications","author":"T Balabanov","year":"2015","unstructured":"Balabanov, T., Zankinski, I., Shumanov, B.: Slot machines RTP optimization with genetic algorithms. In: Dimov, I., Fidanova, S., Lirkov, I. (eds.) NMA 2014. LNCS, vol. 8962, pp. 55\u201361. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15585-2_6"},{"key":"39_CR10","unstructured":"Balabanov, T., Evtimov, G., Koleva, D.: ESGI 120 - Problem 2 - Genetic Algorithm Solver, Sofia, Bulgaria (2016). github.com\/VelbazhdSoftwareLLC\/ESGI120Problem2GeneticAlgorithmSolver"},{"key":"39_CR11","unstructured":"Balabanov, T.: Distributed evolutional model for music composition by human-computer interaction. In: Proceedings of International Scientific Conference UniTech 2015, Gabrovo, Bulgaria, vol. 2, 389\u2013392. University Publishing House V. Aprilov (2015)"},{"key":"39_CR12","unstructured":"Balabanov, T.: Avoiding local optimums in distributed population based heuristic algorithms. In: Proceedings of XXIII International Symposium Management of Energy, Industrial and Environmental Systems, John Atanasoff Union of Automation and Informatics, Sofia, Bulgaria, pp. 83\u201386 (2015). (in Bulgarian)"},{"key":"39_CR13","unstructured":"Balabanov, T.: Heuristic forecasting approaches in distributed environment. In: Proceedings of Anniversary Scientific Conference 40 Years Department of Industrial Automation, Sofia, Bulgaria, pp. 163\u2013166. UCTM (2011). (in Bulgarian)"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73441-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T18:46:53Z","timestamp":1570560413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73441-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319734408","9783319734415"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73441-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}