{"id":"https://openalex.org/W7140235175","doi":"https://doi.org/10.1007/s00453-025-01359-z","title":"The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms","display_name":"The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms","publication_year":2026,"publication_date":"2026-03-24","ids":{"openalex":"https://openalex.org/W7140235175","doi":"https://doi.org/10.1007/s00453-025-01359-z","pmid":"https://pubmed.ncbi.nlm.nih.gov/41889584"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-025-01359-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01359-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s00453-025-01359-z","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Duc-Cuong Dang","orcid":null},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Duc-Cuong Dang","raw_affiliation_strings":["Chair of Algorithms for Intelligent Systems, University of Passau, Innstr. 33, 94032 Passau, Germany"],"affiliations":[{"raw_affiliation_string":"Chair of Algorithms for Intelligent Systems, University of Passau, Innstr. 33, 94032 Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":null,"display_name":"Per Kristian Lehre","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Per Kristian Lehre","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 2TT UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 2TT UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.89174705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"2","first_page":"32","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.5573999881744385,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.5573999881744385,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.267300009727478,"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.11259999871253967,"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/fitness-landscape","display_name":"Fitness landscape","score":0.6949999928474426},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.671500027179718},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6532999873161316},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.635699987411499},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5120999813079834},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4717000126838684},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.46700000762939453},{"id":"https://openalex.org/keywords/fitness-approximation","display_name":"Fitness approximation","score":0.4431999921798706}],"concepts":[{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.6949999928474426},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.671500027179718},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6532999873161316},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.635699987411499},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5120999813079834},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46939998865127563},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.46700000762939453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45890000462532043},{"id":"https://openalex.org/C148392497","wikidata":"https://www.wikidata.org/wiki/Q16250539","display_name":"Fitness approximation","level":4,"score":0.4431999921798706},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4431000053882599},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.43549999594688416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43140000104904175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41819998621940613},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.40869998931884766},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.35589998960494995},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C207002847","wikidata":"https://www.wikidata.org/wiki/Q2912857","display_name":"Evolution strategy","level":3,"score":0.31630000472068787},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.31310001015663147},{"id":"https://openalex.org/C123189799","wikidata":"https://www.wikidata.org/wiki/Q6045380","display_name":"Interactive evolutionary computation","level":4,"score":0.30090001225471497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2948000133037567},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.271699994802475},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2572999894618988}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-025-01359-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01359-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmid:41889584","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/41889584","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire/577d6624-529f-4ecc-8d5f-ae5eb9949a49","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/577d6624-529f-4ecc-8d5f-ae5eb9949a49","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Dang, D-C & Lehre, P K 2026, 'The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms', Algorithmica, vol. 88, no. 2, 32. https://doi.org/10.1007/s00453-025-01359-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pubmedcentral.nih.gov:13013112","is_oa":true,"landing_page_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC13013112/","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s00453-025-01359-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-025-01359-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.5169944167137146}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W139482607","https://openalex.org/W1522597852","https://openalex.org/W1970185413","https://openalex.org/W1977945115","https://openalex.org/W1981482533","https://openalex.org/W1989244967","https://openalex.org/W1997367770","https://openalex.org/W2003005797","https://openalex.org/W2005228957","https://openalex.org/W2019065924","https://openalex.org/W2023146810","https://openalex.org/W2025373303","https://openalex.org/W2060951702","https://openalex.org/W2104578628","https://openalex.org/W2115738889","https://openalex.org/W2151554678","https://openalex.org/W2157054705","https://openalex.org/W2169359757","https://openalex.org/W2197473496","https://openalex.org/W2217395273","https://openalex.org/W2390981491","https://openalex.org/W2499441210","https://openalex.org/W2643418988","https://openalex.org/W2784961280","https://openalex.org/W2962773240","https://openalex.org/W3014797295","https://openalex.org/W3162553722","https://openalex.org/W3176588845","https://openalex.org/W3206403892","https://openalex.org/W4230058301","https://openalex.org/W4230960895","https://openalex.org/W4288044853","https://openalex.org/W4291418343","https://openalex.org/W4384024760","https://openalex.org/W4393977334","https://openalex.org/W4400412805","https://openalex.org/W4410028317"],"related_works":[],"abstract_inverted_index":{"While":[0],"some":[1,94],"common":[2],"fitness":[3,19,51,210],"landscape":[4,20],"characteristics":[5,56],"are":[6,137,213],"critical":[7],"when":[8,57],"determining":[9,58],"the":[10,16,23,48,59,69,107,130,161,189],"runtime":[11,24,60,131],"of":[12,25,38,44,50,61,68,96,132,170,226],"evolutionary":[13],"algorithms":[14],"(EAs),":[15],"relationship":[17],"between":[18],"structure":[21],"and":[22,33,47,71,99,146,156,175,185],"EAs":[26,62],"is":[27,124],"poorly":[28],"understood.":[29],"Recently,":[30],"Dang,":[31],"Eremeev,":[32],"Lehre":[34],"introduced":[35],"a":[36,111,227,245],"classification":[37],"pseudo-Boolean":[39,97,116],"problems":[40,136,174,176,196],"showing":[41],"that":[42,248],"\"sparsity\"":[43],"local":[45,206],"optima":[46,207],"\"density\"":[49],"valleys":[52],"can":[53,229,249],"be":[54,251],"crucial":[55],"Dang":[63],"et":[64],"al.":[65],"(in":[66],"Proceedings":[67],"Genetic":[70],"Evolutionary":[72],"Computation":[73],"Conference.":[74],"Association":[75],"for":[76,114,129,142],"Computing":[77],"Machinery,":[78],"New":[79],"York,":[80],"NY,":[81],"USA,":[82],"GECCO'21,":[83],"pp":[84],"1133-1141,":[85],"10.1145/3449639.3459398,":[86],"2021c).":[87],"However,":[88],"their":[89],"approach":[90],"could":[91],"only":[92],"classify":[93],"classes":[95,204],"functions":[98],"thus":[100],"defined":[101],"an":[102],"incomplete":[103],"hierarchy.":[104],"We":[105,220],"generalise":[106],"previous":[108],"work":[109],"to":[110,215,244],"complete":[112],"hierarchy":[113,123],"all":[115],"functions,":[117,167],"denoted":[118],"Slo[Formula:":[119,139],"see":[120,140,144,148,154,159,183,187],"text].":[121,149],"The":[122,134],"consistent":[125],"with":[126,240,254],"existing":[127],"results":[128],"EAs.":[133,258],"easiest":[135],"in":[138,238],"text]":[141,145,155,184,188],"[Formula:":[143,147,153,158,182,186],"As":[150],"we":[151],"increase":[152],"decrease":[157],"text],":[160],"function":[162,228],"class":[163,191,247],"contains":[164,192],"more":[165],"interesting":[166],"including":[168,195],"instances":[169],"hard":[171],"combinatorial":[172],"optimisation":[173],"perturbed":[177],"by":[178],"static":[179],"noise.":[180],"For":[181],"problem":[190,246],"every":[193],"problem,":[194],"closed":[197],"under":[198],"permutation":[199],"(No":[200],"Free":[201],"Lunch).":[202],"Problem":[203],"where":[205],"sparsity":[208],"exceed":[209],"valley":[211],"density":[212],"shown":[214],"have":[216],"exponential":[217],"black-box":[218],"complexity.":[219],"also":[221],"study":[222],"how":[223],"random":[224],"perturbations":[225],"change":[230],"its":[231],"classification.":[232],"E.g.,":[233],"randomly":[234],"perturbing":[235],"search":[236],"points":[237],"OneMax":[239],"constant":[241],"probability":[242],"leads":[243],"still":[250],"optimised":[252],"efficiently":[253],"appropriately":[255],"tuned":[256],"non-elitist":[257]},"counts_by_year":[],"updated_date":"2026-03-28T06:11:35.319607","created_date":"2025-12-10T00:00:00"}