{"id":"https://openalex.org/W2003092594","doi":"https://doi.org/10.1145/2576768.2598278","title":"Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems","display_name":"Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W2003092594","doi":"https://doi.org/10.1145/2576768.2598278","mag":"2003092594"},"language":"en","primary_location":{"id":"doi:10.1145/2576768.2598278","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","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/A5004695687","display_name":"Andrew M. Sutton","orcid":"https://orcid.org/0000-0003-1295-6715"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andrew M. Sutton","raw_affiliation_strings":["Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Friedrich-Schiller-Universit\u00e4t Jena, Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004695687"],"corresponding_institution_ids":["https://openalex.org/I76198965"],"apc_list":null,"apc_paid":null,"fwci":0.818,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.79999359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"54","issue":null,"first_page":"1431","last_page":"1438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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.9983000159263611,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.995199978351593,"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.9771999716758728,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6961644887924194},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6698192954063416},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6067189574241638},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.5053070187568665},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4898621737957001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44855058193206787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44744426012039185},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43473339080810547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4329685568809509},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4255387783050537},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.41802603006362915},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.415669322013855},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2835356891155243},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07099983096122742},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07000988721847534}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6961644887924194},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6698192954063416},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6067189574241638},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.5053070187568665},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4898621737957001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44855058193206787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44744426012039185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43473339080810547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4329685568809509},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4255387783050537},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.41802603006362915},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.415669322013855},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2835356891155243},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07099983096122742},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07000988721847534},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2576768.2598278","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G405836512","display_name":null,"funder_award_id":"618091","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320337525","display_name":"Air Force Materiel Command","ror":"https://ror.org/006gmme17"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1522890465","https://openalex.org/W1528319822","https://openalex.org/W1537230380","https://openalex.org/W1537936986","https://openalex.org/W1544565521","https://openalex.org/W1632066424","https://openalex.org/W1978984733","https://openalex.org/W1981482533","https://openalex.org/W1987440472","https://openalex.org/W2000394108","https://openalex.org/W2003464009","https://openalex.org/W2005317641","https://openalex.org/W2027557853","https://openalex.org/W2031823362","https://openalex.org/W2040194491","https://openalex.org/W2051641102","https://openalex.org/W2061751517","https://openalex.org/W2076588308","https://openalex.org/W2100137329","https://openalex.org/W2102044362","https://openalex.org/W2154596660","https://openalex.org/W2159088557","https://openalex.org/W2160241726","https://openalex.org/W2166566648","https://openalex.org/W2950855788","https://openalex.org/W3122779104","https://openalex.org/W4230058301"],"related_works":["https://openalex.org/W2151412766","https://openalex.org/W4390091606","https://openalex.org/W2356704893","https://openalex.org/W3124896382","https://openalex.org/W2031636249","https://openalex.org/W4206542614","https://openalex.org/W2071306171","https://openalex.org/W2163551942","https://openalex.org/W2802587985","https://openalex.org/W130689240"],"abstract_inverted_index":{"The":[0],"(1+1)":[1,131,147],"EA":[2,132,148],"is":[3,9,61,82,89],"a":[4,40,50,104,154],"simple":[5,105],"evolutionary":[6,106],"algorithm":[7,75],"that":[8,59,69],"known":[10],"to":[11,77,90,119,144,152],"be":[12],"efficient":[13],"on":[14,18,31,63,99,158],"linear":[15],"functions":[16,81],"and":[17,45,135],"some":[19],"combinatorial":[20,34],"optimization":[21],"problems.":[22,160],"In":[23],"this":[24],"paper,":[25],"we":[26,141],"rigorously":[27],"study":[28],"its":[29],"behavior":[30],"two":[32],"easy":[33],"problems:":[35],"finding":[36],"the":[37,67,70,74,79,93,100,130,146],"2-coloring":[38],"of":[39,42,52,72,95,103,114],"class":[41,51],"bipartite":[43],"graphs,":[44],"constructing":[46],"satisfying":[47],"assignments":[48],"for":[49],"satisfiable":[53],"2-CNF":[54],"Boolean":[55],"formulas.":[56],"We":[57,108],"prove":[58],"it":[60],"inefficient":[62],"both":[64,159],"problems":[65],"in":[66,111,150],"sense":[68],"number":[71],"iterations":[73],"needs":[76],"minimize":[78],"cost":[80],"superpolynomial":[83],"with":[84,125],"high":[85],"probability.":[86],"Our":[87],"motivation":[88],"better":[91],"understand":[92],"influence":[94],"problem":[96],"instance":[97],"structure":[98],"runtime":[101],"character":[102],"algorithm.":[107],"are":[109],"interested":[110],"what":[112],"kind":[113],"structural":[115],"features":[116],"give":[117],"rise":[118],"so-called":[120],"metastable":[121],"states":[122],"at":[123],"which,":[124],"probability":[126],"1":[127],"-":[128],"o(1),":[129],"becomes":[133],"trapped":[134],"subsequently":[136],"has":[137],"difficulty":[138],"leaving.":[139],"Finally,":[140],"show":[142],"how":[143],"modify":[145],"slightly":[149],"order":[151],"obtain":[153],"polynomial-time":[155],"performance":[156],"guarantee":[157]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}