{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:19:04Z","timestamp":1725751144798},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642419461"},{"type":"electronic","value":"9783642419478"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41947-8_24","type":"book-chapter","created":{"date-parts":[[2013,10,5]],"date-time":"2013-10-05T15:06:54Z","timestamp":1380985614000},"page":"285-296","source":"Crossref","is-referenced-by-count":5,"title":["Computational Algorithmic Generation of High-Quality Colour Patterns"],"prefix":"10.1007","author":[{"given":"Alfonsas","family":"Misevi\u010dius","sequence":"first","affiliation":[]},{"given":"Evaldas","family":"Guogis","sequence":"additional","affiliation":[]},{"given":"Evelina","family":"Stanevi\u010dien\u0117","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB \u2013 a quadratic assignment problem library. J. Glob. Optim.\u00a010, 391\u2013403 (1997), http:\/\/www.seas.upenn.edu\/qaplib (cited June 29, 2013)","journal-title":"J. Glob. Optim."},{"key":"24_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Dordrecht (1998)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s00291-005-0010-7","volume":"28","author":"Z. Drezner","year":"2006","unstructured":"Drezner, Z.: Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectrum\u00a028, 417\u2013436 (2006)","journal-title":"OR Spectrum"},{"key":"24_CR4","unstructured":"Kang, H.R.: Digital Color Halftoning. In: Dougherty, E.R. (ed.). SPIE\/IEEE Series on Imaging Science & Engineering. The SPIE Optical Engineering Press\/IEEE Press, Bellingham\/Piscataway (1999)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Lau, D.L., Arce, G.R.: Modern Digital Halftoning, Sec. Ed. In: Liu, K.J.R. (ed.). Signal Processing and Communications Series. Marcel Dekker, New York-Basel (2008)","DOI":"10.1201\/9781420047547"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.15388\/Informatica.2006.136","volume":"17","author":"A. Misevi\u010dius","year":"2006","unstructured":"Misevi\u010dius, A.: Experiments with hybrid genetic algorithm for the grey pattern problem. Informatica\u00a017, 237\u2013258 (2006)","journal-title":"Informatica"},{"key":"24_CR7","first-page":"330","volume":"40","author":"A. Misevi\u010dius","year":"2011","unstructured":"Misevi\u010dius, A.: Generation of grey patterns using an improved genetic evolutionary algorithm: Some new results. Inform. Technol. Contr.\u00a040, 330\u2013343 (2011)","journal-title":"Inform. Technol. Contr."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s00291-011-0274-z","volume":"34","author":"A. Misevicius","year":"2012","unstructured":"Misevicius, A.: An implementation of the iterated tabu search algorithm for the quadratic assignment problem. OR Spectrum\u00a034, 665\u2013690 (2012), doi:10.1007\/s00291-011-0274-z","journal-title":"OR Spectrum"},{"key":"24_CR9","first-page":"15","volume":"34","author":"A. Misevi\u010dius","year":"2005","unstructured":"Misevi\u010dius, A., Rubliauskas, D.: Performance of hybrid genetic algorithm for the grey pattern problem. Inform. Technol. Contr.\u00a034, 15\u201324 (2005)","journal-title":"Inform. Technol. Contr."},{"key":"24_CR10","volume-title":"Introduction to Genetic Algorithms","author":"S.N. Sivanandam","year":"2008","unstructured":"Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2008)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"E.D. Taillard","year":"1995","unstructured":"Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Locat. Sci.\u00a03, 87\u2013105 (1995)","journal-title":"Locat. Sci."},{"key":"24_CR12","unstructured":"Taillard, E.D., Gambardella, L.M.: Adaptive memories for the quadratic assignment problem. Techn. Report. IDSIA-87-97, Lugano, Switzerland (1997)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Ulichney, R.A.: Digital Halftoning. MIT Press, London (1987)","DOI":"10.7551\/mitpress\/2421.001.0001"}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41947-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T09:51:43Z","timestamp":1596621103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41947-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642419461","9783642419478"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41947-8_24","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}