{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:37Z","timestamp":1760202577253,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389277","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"953-960","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Rigorous analyses of fitness-proportional selection for optimizing linear functions"],"prefix":"10.1145","author":[{"given":"Edda","family":"Happ","sequence":"first","affiliation":[{"name":"Max-Planck-Institut Informatik, Saarbruecken, Germany"}]},{"given":"Daniel","family":"Johannsen","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut Informatik, Saarbruecken, Germany"}]},{"given":"Christian","family":"Klein","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut Informatik, Saarbruecken, Germany"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut Informatik, Saarbruecken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_2_1","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller W.","year":"1968","unstructured":"W. Feller . An Introduction to Probability Theory and Its Applications , vol. 1 . Wiley , 3 rd edition, 1968 . W. Feller. An Introduction to Probability Theory and Its Applications, vol. 1. Wiley, 3rd edition, 1968.","edition":"3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1143997.1144114"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"415","volume-title":"Proceedings of STACS '03","author":"Giel O.","year":"2003","unstructured":"O. Giel and I. Wegener . Evolutionary algorithms and the maximum matching problem . In Proceedings of STACS '03 , vol. 2607 of LNCS , pages 415 -- 426 , 2003 . O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proceedings of STACS '03, vol. 2607 of LNCS, pages 415--426, 2003."},{"key":"e_1_3_2_1_5_1","volume-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"Goldberg D. E.","year":"1989","unstructured":"D. E. Goldberg . Genetic Algorithms in Search Optimization and Machine Learning . Addison-Wesley , 1989 . D. E. Goldberg. Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, 1989."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1162\/evco.1999.7.3.231"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1016\/S0004-3702(01)00058-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1016\/S0004-3702(02)00381-8"},{"key":"e_1_3_2_1_9_1","first-page":"15","volume-title":"Proceedings of PPSN '92","author":"M\u00fchlenbein H.","year":"1992","unstructured":"H. M\u00fchlenbein . How genetic algorithms really work: mutation and hillclimbing . In Proceedings of PPSN '92 , pages 15 -- 26 . Elsevier , 1992 . H. M\u00fchlenbein. How genetic algorithms really work: mutation and hillclimbing. In Proceedings of PPSN '92, pages 15--26. Elsevier, 1992."},{"key":"e_1_3_2_1_10_1","first-page":"15","volume-title":"Proceedings of PPSN '92","author":"M\u00fchlenbein H.","year":"1992","unstructured":"H. M\u00fchlenbein . How genetic algorithms really work: mutation and hillclimbing . In Proceedings of PPSN '92 , pages 15 -- 26 . Elsevier , 1992 . H. M\u00fchlenbein. How genetic algorithms really work: mutation and hillclimbing. In Proceedings of PPSN '92, pages 15--26. Elsevier, 1992."},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"713","volume-title":"Proceedings of GECCO '04","author":"Neumann F.","year":"2004","unstructured":"F. Neumann and I. Wegener . Randomized local search, evolutionary algorithms, and the minimum spanning tree problem . In Proceedings of GECCO '04 , vol. 3102 of LNCS , pages 713 -- 724 , 2004 . F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In Proceedings of GECCO '04, vol. 3102 of LNCS, pages 713--724, 2004."},{"key":"e_1_3_2_1_12_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","author":"Neumann F.","year":"2006","unstructured":"F. Neumann and C. Witt . Ant colony optimization and the minimum spanning tree problem . In Electronic Colloquium on Computational Complexity (ECCC) , 2006 . Report No. 143. F. Neumann and C. Witt. Ant colony optimization and the minimum spanning tree problem. In Electronic Colloquium on Computational Complexity (ECCC), 2006. Report No. 143."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1162\/evco.1996.4.2.195"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","first-page":"761","volume-title":"Proceedings of GECCO '04","author":"Witt C.","year":"2004","unstructured":"C. Witt . An analysis of the (\u03bc+1) ea on simple pseudoboolean functions . In Proceedings of GECCO '04 , vol. 3102 of LNCS , pages 761 -- 773 , 2004 . C. Witt. An analysis of the (\u03bc+1) ea on simple pseudoboolean functions. In Proceedings of GECCO '04, vol. 3102 of LNCS, pages 761--773, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"acronym":"GECCO08","name":"GECCO08: Genetic and Evolutionary Computation Conference","location":"Atlanta GA USA"},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389277","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:41Z","timestamp":1750255061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":15,"alternative-id":["10.1145\/1389095.1389277","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389277","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}