{"id":"https://openalex.org/W2055766874","doi":"https://doi.org/10.1109/cec.2013.6557756","title":"A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem","display_name":"A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2055766874","doi":"https://doi.org/10.1109/cec.2013.6557756","mag":"2055766874"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5083519582","display_name":"Michael J. Dinneen","orcid":"https://orcid.org/0000-0001-9977-525X"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Michael J. Dinneen","raw_affiliation_strings":["Department of Computer Science, University of Auckland, Auckland, New Zealand","Dept. of Computer Science, University of Auckland Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Auckland Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077035897","display_name":"Kuai Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Kuai Wei","raw_affiliation_strings":["Department of Computer Science, University of Auckland, Auckland, New Zealand","Dept. of Computer Science, University of Auckland Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Auckland Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154130895"],"apc_list":null,"apc_paid":null,"fwci":0.9194,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74939913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"379","issue":null,"first_page":"1626","last_page":"1634"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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.9983999729156494,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.977400004863739,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.819645345211029},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.7885538339614868},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6733846664428711},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6608795523643494},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5770462155342102},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5149275064468384},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5064204931259155},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.49151143431663513},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47078126668930054},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4458996653556824},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.44233042001724243},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44168171286582947},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42449212074279785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3886846601963043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37422797083854675},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30801743268966675},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.18901637196540833}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.819645345211029},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.7885538339614868},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6733846664428711},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6608795523643494},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5770462155342102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5149275064468384},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5064204931259155},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.49151143431663513},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47078126668930054},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4458996653556824},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.44233042001724243},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44168171286582947},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42449212074279785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3886846601963043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37422797083854675},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30801743268966675},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.18901637196540833},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2013.6557756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:researchspace.auckland.ac.nz:2292/23556","is_oa":false,"landing_page_url":"https://hdl.handle.net/2292/23556","pdf_url":null,"source":{"id":"https://openalex.org/S7407055463","display_name":"ResearchSpace (University of Auckland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I154130895","host_organization_name":"University of Auckland","host_organization_lineage":["https://openalex.org/I154130895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W178264497","https://openalex.org/W372717656","https://openalex.org/W659473080","https://openalex.org/W1481334272","https://openalex.org/W1487360687","https://openalex.org/W1522890465","https://openalex.org/W1547915777","https://openalex.org/W1606499289","https://openalex.org/W1636202028","https://openalex.org/W1970101133","https://openalex.org/W1972500177","https://openalex.org/W1975791498","https://openalex.org/W2011559870","https://openalex.org/W2011576841","https://openalex.org/W2015122083","https://openalex.org/W2041101799","https://openalex.org/W2052468331","https://openalex.org/W2053987102","https://openalex.org/W2085647403","https://openalex.org/W2091824805","https://openalex.org/W2097724176","https://openalex.org/W2105792062","https://openalex.org/W2107932015","https://openalex.org/W2125296193","https://openalex.org/W2161238506","https://openalex.org/W2165220807","https://openalex.org/W2609084166","https://openalex.org/W6629143895","https://openalex.org/W6631411568","https://openalex.org/W6632690370","https://openalex.org/W6636602131"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W2891037262","https://openalex.org/W4300229885","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W4224326468","https://openalex.org/W2617596428"],"abstract_inverted_index":{"A":[0],"memetic":[1],"algorithm":[2,148],"(MA)":[3],"is":[4,173,193],"an":[5,147,150],"Evolutionary":[6],"Algorithm":[7,21],"(EA)":[8],"augmented":[9],"with":[10,23,31,187,227],"a":[11,17,74,82,97,116,128,155,159,188],"local":[12,26,83,170,191,201,231],"search.":[13,232],"We":[14,72],"previously":[15],"defined":[16],"(1+1)":[18,34,37,40,70,185,210],"Adaptive":[19],"Memetic":[20],"(AMA)":[22],"two":[24],"different":[25],"searches,":[27],"and":[28,39,63,85,123],"the":[29,32,58,65,91,108,132,207,220,228],"comparison":[30],"well-known":[33,208],"EA,":[35],"Dynamic":[36],"EA":[38],"MA":[41],"on":[42,57,102,119,138],"some":[43],"toy":[44],"functions":[45],"showed":[46],"promise":[47],"for":[48],"our":[49,68,139,183,215,223],"proposed":[50,69,184],"algorithm.":[51],"In":[52],"this":[53,88,103],"paper":[54],"we":[55,106,142,179],"focus":[56],"NP-hard":[59],"Maximum":[60],"Clique":[61],"Problem,":[62],"show":[64,86,107,144,181],"success":[66,213],"of":[67,95,134,158,214,222],"AMA.":[71],"propose":[73],"new":[75,104,140],"metric":[76,89],"(expected":[77],"running":[78,93],"time":[79,94,130,152],"to":[80,114,153,176,195,199],"escape":[81,196],"optimal),":[84],"how":[87],"dominates":[90],"expected":[92,113,194],"finding":[96],"maximum":[98,117,156],"clique.":[99],"Then":[100],"based":[101,137],"metric,":[105,141],"above":[109],"analyzed":[110],"algorithms":[111],"are":[112],"find":[115,154],"clique":[118,157],"graphs,":[120],"bipartite":[121],"graphs":[122,126],"sparse":[124],"random":[125,189,229],"in":[127,131],"polynomial":[129],"number":[133],"vertices.":[135],"Also":[136],"will":[143,180],"that":[145,172,182],"if":[146],"takes":[149],"exponential":[151],"graph,":[160],"it":[161],"must":[162],"have":[163],"been":[164],"trapped":[165],"into":[166],"at":[167],"least":[168],"one":[169],"optimal":[171,202],"extremely":[174],"hard":[175],"escape.":[177],"Furthermore,":[178],"AMA":[186],"permutation":[190,230],"search":[192],"these":[197],"(hard":[198],"escape)":[200],"cliques":[203],"drastically":[204],"faster":[205],"than":[206],"basic":[209],"EA.":[211],"The":[212],"experimental":[216],"results":[217],"also":[218],"shows":[219],"benefit":[221],"adaptive":[224],"strategy":[225],"combined":[226]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}