{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:04:37Z","timestamp":1773655477475,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["074-U01"],"award-info":[{"award-number":["074-U01"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006289","name":"\u00c9lectricit\u00e9 de France","doi-asserted-by":"publisher","award":["FMJH Program Gaspard Monge in optimization and operations research"],"award-info":[{"award-number":["FMJH Program Gaspard Monge in optimization and operations research"]}],"id":[{"id":"10.13039\/501100006289","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3071297","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"1343-1350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Runtime analysis of the (1 + (\n            <i>\u03bb, \u03bb<\/i>\n            )) genetic algorithm on random satisfiable 3-CNF formulas"],"prefix":"10.1145","author":[{"given":"Maxim","family":"Buzdalov","sequence":"first","affiliation":[{"name":"ITMO University, Saint-Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725504"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908885"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754684"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754683"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754659"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598350"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"e_1_3_2_1_9_1","first-page":"148","article-title":"On the Method of Bounded Differences","volume":"141","author":"McDiarmid Colin","year":"1989","unstructured":"Colin McDiarmid . 1989 . On the Method of Bounded Differences . Surveys in Combinatorics 141 (1989), 148 -- 188 . Colin McDiarmid. 1989. On the Method of Bounded Differences. Surveys in Combinatorics 141 (1989), 148--188.","journal-title":"Surveys in Combinatorics"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330260"},{"key":"e_1_3_2_1_11_1","volume-title":"Sutton and Frank Neumann","author":"Andrew","year":"2014","unstructured":"Andrew M. Sutton and Frank Neumann . 2014 . Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. In Proceedings of Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 8672 . Springer , 942--951. Andrew M. Sutton and Frank Neumann. 2014. Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. In Proceedings of Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 8672. Springer, 942--951."},{"key":"e_1_3_2_1_12_1","volume-title":"Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions","author":"Wegener Ingo","unstructured":"Ingo Wegener . 2002. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions . In Evolutionary Optimization, S. Sarker, X. Yao, and M. Mohammadian (Eds.). Kluwer , Dordrecht , 349--369. Ingo Wegener. 2002. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In Evolutionary Optimization, S. Sarker, X. Yao, and M. Mohammadian (Eds.). Kluwer, Dordrecht, 349--369."}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","location":"Berlin Germany","acronym":"GECCO '17","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:05Z","timestamp":1750217405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":12,"alternative-id":["10.1145\/3071178.3071297","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071297","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}