{"id":"https://openalex.org/W2098473938","doi":"https://doi.org/10.1109/cec.2004.1330860","title":"NFL theorem is unusable on structured classes of problems","display_name":"NFL theorem is unusable on structured classes of problems","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W2098473938","doi":"https://doi.org/10.1109/cec.2004.1330860","mag":"2098473938"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2004.1330860","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1330860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","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/A5090596232","display_name":"Benjamin Weinberg","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"B. Weinberg","raw_affiliation_strings":["LIFL-UMR 8022 CNRS, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d'Ascq, France","Univ. des Sci. et Technol. de Lille, Villeneuve d' Ascq, France"],"affiliations":[{"raw_affiliation_string":"LIFL-UMR 8022 CNRS, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Univ. des Sci. et Technol. de Lille, Villeneuve d' Ascq, France","institution_ids":["https://openalex.org/I2279609970"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107857046","display_name":"El\u2010Ghazali Talbi","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"E.-G. Talbi","raw_affiliation_strings":["LIFL-UMR 8022 CNRS, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d'Ascq, France","Univ. des Sci. et Technol. de Lille, Villeneuve d' Ascq, France"],"affiliations":[{"raw_affiliation_string":"LIFL-UMR 8022 CNRS, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d'Ascq, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Univ. des Sci. et Technol. de Lille, Villeneuve d' Ascq, France","institution_ids":["https://openalex.org/I2279609970"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090596232"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2279609970"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.11561896,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"220","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965000152587891,"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.9965000152587891,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6469202041625977},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6034403443336487},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5666263103485107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5211244225502014},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.49405911564826965},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4795822203159332},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41131314635276794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39681434631347656},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38152217864990234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36659660935401917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3170008063316345}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6469202041625977},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6034403443336487},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5666263103485107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5211244225502014},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.49405911564826965},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4795822203159332},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41131314635276794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39681434631347656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38152217864990234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36659660935401917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3170008063316345},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2004.1330860","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1330860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W67550657","https://openalex.org/W1482099672","https://openalex.org/W1485560021","https://openalex.org/W1493992103","https://openalex.org/W1499561572","https://openalex.org/W1529571708","https://openalex.org/W1551393520","https://openalex.org/W1909483428","https://openalex.org/W1969680573","https://openalex.org/W1971700807","https://openalex.org/W1977945115","https://openalex.org/W2106378689","https://openalex.org/W2151554678","https://openalex.org/W4244456148","https://openalex.org/W4247657039","https://openalex.org/W6602713643","https://openalex.org/W6628852525","https://openalex.org/W6631746592"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560","https://openalex.org/W4375949242","https://openalex.org/W1581805909"],"abstract_inverted_index":{"Nowadays,":[0],"in":[1,70,79,143,193],"the":[2,65,71,91,122,135,138,152,158,181,184,212,217,225,234,240,249,255,262],"heuristic":[3,21],"and":[4,29,44,74,146,170,231,239,260,266],"metaheuristics":[5,265],"community,":[6],"there":[7,56],"is":[8,35,191],"a":[9,19,26,68,104,114,163,204],"schism":[10],"between":[11,236,264],"researchers":[12],"who":[13,46],"say:":[14],"\"we":[15],"proved":[16,129],"experimentally":[17],"that":[18,33,55,75,85,183,199],"given":[20,27],"provides":[22],"good":[23],"results":[24],"on":[25,222,254],"problem":[28,73,93],"we":[30,107,120,161,197,215],"can":[31,77],"guess":[32],"it":[34],"enough":[36],"general":[37],"to":[38,116,130,133,176,180],"be":[39,131],"applied":[40],"for":[41,90,208],"other":[42,80],"problems\",":[43],"those":[45],"claim:":[47],"\"the":[48],"No":[49],"Free":[50],"Lunch":[51],"theorem":[52],"(NFL)":[53],"proves":[54],"exists":[57],"no":[58],"absolute":[59],"efficient":[60],"heuristic\".":[61],"The":[62,82],"formers":[63],"suspect":[64],"existence":[66,123],"of":[67,99,124,137,141,154,166,186,188,206,219,228,251,258],"structure":[69,76,187,232],"solved":[72],"occur":[78],"problems.":[81,102],"latters":[83],"fear":[84],"heuristics":[86],"are":[87,128],"especially":[88],"adapted":[89],"testbed":[92],"this":[94],"paper":[95],"addresses":[96],"structural":[97],"aspect":[98],"combinatorial":[100],"optimization":[101,144,189],"In":[103,157,211],"first":[105],"time,":[106],"recall":[108,121],"some":[109,147],"related":[110],"works":[111,148,169],"which":[112,127,149,242],"provide":[113],"frame":[115],"our":[117,220,237,252],"work.":[118],"Particularly,":[119],"deceptive":[125],"problems":[126,190,201,230],"hard":[132],"optimize,":[134],"definitions":[136],"five":[139,256],"scenarios":[140,257],"knowledge":[142],"problem,":[145],"already":[150],"discuss":[151,171,216],"reach":[153],"NFL":[155,168,194,244],"theorem.":[156],"next":[159],"part,":[160],"give":[162],"short":[164],"overview":[165],"how":[167],"its":[172],"significance":[173],"with":[174],"regards":[175],"complexity.":[177],"This":[178],"leads":[179],"observation":[182],"notion":[185,205],"missing":[192],"use.":[195],"Then,":[196],"prove":[198],"k-coloring":[200],"respect":[202],"such":[203],"structure,":[207],"any":[209],"k.":[210],"last":[213],"part":[214],"relevance":[218],"work":[221,238],"four":[223],"points:":[224],"polynomial":[226],"reduction":[227],"NP-complete":[229],"preservation,":[233],"connection":[235],"study":[241,253],"squeeze":[243],"using":[245],"neighborhood":[246],"search":[247],"operators,":[248],"position":[250],"knowledge,":[259],"finally":[261],"difference":[263],"heuristics.":[267]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}