{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:17:59Z","timestamp":1754482679495},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410560"},{"type":"electronic","value":"9783540453567"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45356-3_67","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T23:33:28Z","timestamp":1188344008000},"page":"683-692","source":"Crossref","is-referenced-by-count":3,"title":["Scalability and Efficiency of Genetic Algorithms for Geometrical Applications"],"prefix":"10.1007","author":[{"given":"Steven","family":"van Dijk","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Thierens","sequence":"additional","affiliation":[]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","unstructured":"T. B\u00e4ck. Generalized convergence models for tournament-and (\u03bc, \u03bb)-selection. In L. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 2\u20138, San Francisco, CA, 1995. Morgan Kaufmann."},{"key":"67_CR2","unstructured":"D. Goldberg, K. Deb, and J. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6, 1992."},{"issue":"3","key":"67_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","volume":"7","author":"G. Harik","year":"1999","unstructured":"G. Harik, E. Cant\u00fa-Paz, D. Goldberg, and B. Miller. The gambler\u2019s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231\u2013253, 1999.","journal-title":"Evolutionary Computation"},{"key":"67_CR4","unstructured":"J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report TR-05-91, Harvard University, March 1991."},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"B. Miller and D. Goldberg. Genetic algorithms, selection schemes, and the varying effects of noise. Evolutionary Computation, 4(2), 1996.","DOI":"10.1162\/evco.1996.4.2.113"},{"issue":"1","key":"67_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1162\/evco.1993.1.1.25","volume":"1","author":"H. M\u00fchlenbein","year":"1993","unstructured":"H. M\u00fchlenbein and D. Schlierkamp-Voosen. Predictive models for the breeder genetic algorithm: Continuous parameter optimization. Evolutionary Computation, 1(1):25\u201349, 1993.","journal-title":"Evolutionary Computation"},{"key":"67_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-58484-6_256","volume":"3","author":"D. Thierens","year":"1994","unstructured":"D. Thierens and D. Goldberg. Convergence models of genetic algorithm selection schemes. Parallel Problem Solving from Nature, 3:119\u2013129, 1994.","journal-title":"Parallel Problem Solving from Nature"},{"key":"67_CR8","first-page":"508","volume-title":"Proc. IEEE Int. Conf. on Evolutionary Computation","author":"D. Thierens","year":"1994","unstructured":"D. Thierens and D. Goldberg. Elitist recombination: An integrated selection recombination GA. In Proc. IEEE Int. Conf. on Evolutionary Computation, pages 508\u2013512. IEEE Service Center, Piscataway, NJ, 1994."},{"key":"67_CR9","unstructured":"S. van Dijk, D. Thierens, and M. de Berg. Robust genetic algorithms for high quality map labeling. Technical Report TR-1998-41, Utrecht University, 1998."},{"key":"67_CR10","unstructured":"S. van Dijk, D. Thierens, and M. de Berg. On the design of genetic algorithms for geographical applications. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann, July 1999."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature PPSN VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45356-3_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T01:37:47Z","timestamp":1550885867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45356-3_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410560","9783540453567"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45356-3_67","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}