{"id":"https://openalex.org/W3101304319","doi":"https://doi.org/10.1007/978-3-030-58115-2_42","title":"Lower Bounds for Non-elitist Evolutionary Algorithms via Negative Multiplicative Drift","display_name":"Lower Bounds for Non-elitist Evolutionary Algorithms via Negative Multiplicative Drift","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3101304319","doi":"https://doi.org/10.1007/978-3-030-58115-2_42","mag":"3101304319"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-58115-2_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58115-2_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102961331","display_name":"Benjamin Doerr","orcid":"https://orcid.org/0000-0002-9786-220X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4210145102","display_name":"Institut Polytechnique de Paris","ror":"https://ror.org/042tfbd02","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Benjamin Doerr","raw_affiliation_strings":["Laboratoire d\u2019Informatique (LIX), CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France","LIX - Laboratoire d'informatique de l'\u00c9cole polytechnique [Palaiseau] (1 Rue Honor\u00e9 d\u2019Estienne d\u2019Orves, B\u00e2timent Alain Turing, 91120 Palaiseau - France)","IP Paris - Institut Polytechnique de Paris (Route de Saclay, 91120 Palaiseau Cedex, France - France)","X - \u00c9cole polytechnique (Route de Saclay, 91128 Palaiseau Cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique (LIX), CNRS, \u00c9cole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France","institution_ids":["https://openalex.org/I4210139461","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIX - Laboratoire d'informatique de l'\u00c9cole polytechnique [Palaiseau] (1 Rue Honor\u00e9 d\u2019Estienne d\u2019Orves, B\u00e2timent Alain Turing, 91120 Palaiseau - France)","institution_ids":["https://openalex.org/I4210139461","https://openalex.org/I142476485"]},{"raw_affiliation_string":"IP Paris - Institut Polytechnique de Paris (Route de Saclay, 91120 Palaiseau Cedex, France - France)","institution_ids":["https://openalex.org/I4210145102"]},{"raw_affiliation_string":"X - \u00c9cole polytechnique (Route de Saclay, 91128 Palaiseau Cedex - France)","institution_ids":["https://openalex.org/I142476485"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102961331"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9252,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89205257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"604","last_page":"618"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9775000214576721,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9750000238418579,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.830183207988739},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5818964838981628},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5750842690467834},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5275554060935974},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5021369457244873},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49062052369117737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4796200692653656},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.4673747420310974},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45433977246284485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36871710419654846},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28094011545181274}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.830183207988739},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5818964838981628},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5750842690467834},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5275554060935974},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5021369457244873},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49062052369117737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4796200692653656},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.4673747420310974},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45433977246284485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36871710419654846},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28094011545181274},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-58115-2_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58115-2_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-04485763v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04485763","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Parallel Problem Solving from Nature, PPSN 2020, 2020, Leiden, Netherlands. pp.604-618, ⟨10.1007/978-3-030-58115-2_42⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W139482607","https://openalex.org/W1488747864","https://openalex.org/W1522597852","https://openalex.org/W1540953389","https://openalex.org/W1596384364","https://openalex.org/W1933565355","https://openalex.org/W1981303977","https://openalex.org/W1983804795","https://openalex.org/W1984555915","https://openalex.org/W1997367770","https://openalex.org/W2004361255","https://openalex.org/W2005317641","https://openalex.org/W2006072452","https://openalex.org/W2061751517","https://openalex.org/W2081568812","https://openalex.org/W2082931571","https://openalex.org/W2084149434","https://openalex.org/W2087605480","https://openalex.org/W2097097696","https://openalex.org/W2102044362","https://openalex.org/W2108288996","https://openalex.org/W2146239736","https://openalex.org/W2165220807","https://openalex.org/W2197473496","https://openalex.org/W2783263582","https://openalex.org/W2807837759","https://openalex.org/W2887810854","https://openalex.org/W2936991357","https://openalex.org/W2940274084","https://openalex.org/W2941999899","https://openalex.org/W2955800573","https://openalex.org/W2962773240","https://openalex.org/W2963154839","https://openalex.org/W3014633408","https://openalex.org/W3023258821","https://openalex.org/W3089839726","https://openalex.org/W3100597221","https://openalex.org/W3101350160","https://openalex.org/W3101412094","https://openalex.org/W3101428723","https://openalex.org/W3103794138","https://openalex.org/W3122779104","https://openalex.org/W3181128415"],"related_works":["https://openalex.org/W2611903952","https://openalex.org/W1807736060","https://openalex.org/W3139626902","https://openalex.org/W2952513604","https://openalex.org/W4288076114","https://openalex.org/W4300796178","https://openalex.org/W4291973374","https://openalex.org/W2027062810","https://openalex.org/W4394883359","https://openalex.org/W2952248228"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":3}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}