{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:11:50Z","timestamp":1747455110611,"version":"3.40.5"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319148021"},{"type":"electronic","value":"9783319148038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14803-8_23","type":"book-chapter","created":{"date-parts":[[2015,1,10]],"date-time":"2015-01-10T01:03:21Z","timestamp":1420851801000},"page":"297-309","source":"Crossref","is-referenced-by-count":3,"title":["Evolving Point Packings in the Plane"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Ashlock","sequence":"first","affiliation":[]},{"given":"Philip","family":"Hingston","sequence":"additional","affiliation":[]},{"given":"Cameron","family":"McGuinness","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1109\/CEC.2013.6557807","volume-title":"Proceedings of the 2013 Congress on Evolutionary Computation","author":"D. Ashlock","year":"2013","unstructured":"Ashlock, D., Krisk, N., Fogel, G.: Functions for the analysis of exploration and exploitation. In: Proceedings of the 2013 Congress on Evolutionary Computation, pp. 2020\u20132027. IEEE Press, Piscataway (2013)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Ashlock, W., Ashlock, D.: Single parent genetic programming. In: Proceedings of the 2005 Congress on Evolutionary Computation, pp. 1172\u20131179 (2005)","DOI":"10.1109\/CEC.2005.1554823"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TEVC.2005.863128","volume":"10","author":"K.M. Bryden","year":"2006","unstructured":"Bryden, K.M., Ashlock, D.A., Corns, S., Willson, S.J.: Graph based evolutionary algorithms. IEEE Transactions on Evolutionary Computation\u00a010, 550\u2013567 (2006)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Caflisch, R.E.: Monte carlo and quasi-monte carlo methods. Acta Numerica\u00a07, 1\u201349 (1998)","DOI":"10.1017\/S0962492900002804"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/978-3-540-74466-5_85","volume-title":"Euro-Par 2007 Parallel Processing","author":"C. Le\u00f3n","year":"2007","unstructured":"Le\u00f3n, C., Miranda, G., Rodr\u00edguez, C., Segura, C.: 2D cutting stock problem: A new parallel algorithm and bounds. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol.\u00a04641, pp. 795\u2013804. Springer, Heidelberg (2007)"},{"issue":"1-3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0166-218X(01)00359-6","volume":"122","author":"M. Locatelli","year":"2002","unstructured":"Locatelli, M., Raber, U.: Packing equal circles in a square: A deterministic global optimization approach. Discrete Appl. Math.\u00a0122(1-3), 139\u2013166 (2002), doi:10.1016\/S0166-218X(01)00359-6","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/S1052623403425617","volume":"16","author":"M.C.. Markot","year":"2005","unstructured":"Markot, M.C., Csendes, T.: A new verified optimization technique for the \u2018packing circles in a unit square; problems. SIAM J. Optimization\u00a016(1), 193\u2013219 (2005)","journal-title":"SIAM J. Optimization"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.biosystems.2013.03.022","volume":"113","author":"A. McEachern","year":"2013","unstructured":"McEachern, A., Ashlock, D., Shonfeld, J.: Sequence classification with side effect machines evolved via ring optimization. Biosystems\u00a0113(1), 9\u201327 (2013)","journal-title":"Biosystems"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1162\/evco.1993.1.2.127","volume":"1","author":"R.E. Smith","year":"1993","unstructured":"Smith, R.E., Forrest, S., Perelson, A.S.: Searching for diverse, cooperative populations with genetic algorithms. Evolutionary Computation\u00a01(2), 127\u2013149 (1993)","journal-title":"Evolutionary Computation"},{"key":"23_CR10","first-page":"94","volume-title":"Foundations of Genetic Algorithms","author":"G. Syswerda","year":"1991","unstructured":"Syswerda, G.: A study of reproduction in generational and steady state genetic algorithms. In: Foundations of Genetic Algorithms, pp. 94\u2013101. Morgan Kaufmann, San Francisco (1991)"},{"key":"23_CR11","volume-title":"Spatially Structured Evolutionary Algorithms","author":"M. Tomassini","year":"2005","unstructured":"Tomassini, M.: Spatially Structured Evolutionary Algorithms. Springer, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Artificial Life and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14803-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T16:58:16Z","timestamp":1747414696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14803-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319148021","9783319148038"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14803-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}