{"id":"https://openalex.org/W1980515043","doi":"https://doi.org/10.1145/1830483.1830753","title":"Optimization speed and fair sets of functions","display_name":"Optimization speed and fair sets of functions","publication_year":2010,"publication_date":"2010-07-07","ids":{"openalex":"https://openalex.org/W1980515043","doi":"https://doi.org/10.1145/1830483.1830753","mag":"1980515043"},"language":"en","primary_location":{"id":"doi:10.1145/1830483.1830753","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1830483.1830753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th 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/A5029102500","display_name":"Andrea Valsecchi","orcid":"https://orcid.org/0000-0002-5956-5749"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea Valsecchi","raw_affiliation_strings":["University of Milano-Bicocca, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"University of Milano-Bicocca, Milan, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056916227","display_name":"Leonardo Vanneschi","orcid":"https://orcid.org/0000-0003-4732-3328"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Leonardo Vanneschi","raw_affiliation_strings":["University of Milano-Bicocca, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"University of Milano-Bicocca, Milan, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073163964","display_name":"Giancarlo Mauri","orcid":"https://orcid.org/0000-0003-3520-4022"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giancarlo Mauri","raw_affiliation_strings":["University of Milano-Bicocca, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"University of Milano-Bicocca, Milan, Italy","institution_ids":["https://openalex.org/I66752286"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029102500"],"corresponding_institution_ids":["https://openalex.org/I66752286"],"apc_list":null,"apc_paid":null,"fwci":0.451,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71077413,"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":"1475","last_page":"1476"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9933000206947327,"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.9933000206947327,"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/T12288","display_name":"Optimization and Search Problems","score":0.989300012588501,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9819999933242798,"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/measure","display_name":"Measure (data warehouse)","score":0.7231458425521851},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6703025102615356},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6157776117324829},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5936934947967529},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5874208211898804},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5233154296875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5096924304962158},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4696929454803467},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34457504749298096},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32870009541511536},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10262882709503174}],"concepts":[{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.7231458425521851},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6703025102615356},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6157776117324829},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5936934947967529},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5874208211898804},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5233154296875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5096924304962158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4696929454803467},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34457504749298096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32870009541511536},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10262882709503174},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1830483.1830753","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1830483.1830753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:boa.unimib.it:10281/50709","is_oa":false,"landing_page_url":"http://hdl.handle.net/10281/50709","pdf_url":null,"source":{"id":"https://openalex.org/S4306401259","display_name":"BOA (University of Milano-Bicocca)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"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":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W67550657","https://openalex.org/W1517645435","https://openalex.org/W1564561244","https://openalex.org/W1969680573","https://openalex.org/W2070505903","https://openalex.org/W2151554678","https://openalex.org/W3004042307"],"related_works":["https://openalex.org/W4255837520","https://openalex.org/W2387011115","https://openalex.org/W2012531322","https://openalex.org/W4234808182","https://openalex.org/W2402761219","https://openalex.org/W2382043075","https://openalex.org/W2809151339","https://openalex.org/W2360673138","https://openalex.org/W2809370583","https://openalex.org/W2785900585"],"abstract_inverted_index":{"The":[0],"Sharpened":[1],"No":[2],"Free":[3],"Lunch":[4],"theorem":[5],"states":[6],"that":[7,19,63],"all":[8,32,88],"optimization":[9,61,95],"algorithms":[10,91],"have":[11,92],"the":[12,26,82,93,110,116],"same":[13,94],"performance":[14,28,33,58],"on":[15,37,55,86],"sets":[16,114],"of":[17,25,84,112,119],"functions":[18,85],"are":[20,35],"closed":[21],"under":[22],"permutation,":[23],"independently":[24],"considered":[27],"measure.":[29],"However,":[30],"not":[31],"measures":[34],"informative":[36],"how":[38,41,65],"fast":[39,66],"or":[40],"accurately":[42],"an":[43,74],"algorithm":[44,69],"can":[45],"solve":[46],"a":[47,56,67],"given":[48],"problem.":[49],"In":[50],"this":[51],"paper":[52],"we":[53,78,103],"focus":[54],"particular":[57],"measure,":[59],"called":[60],"speed,":[62],"quantifies":[64],"search":[68,90],"is":[70],"able":[71],"to":[72,80],"find":[73],"optimal":[75],"solution,":[76],"and":[77,102,115],"try":[79],"characterize":[81],"set":[83],"which":[87],"possible":[89],"speed.":[96],"We":[97],"call":[98],"fair":[99],"these":[100],"sets,":[101],"prove":[104],"some":[105],"results":[106],"about":[107],"their":[108],"structure,":[109],"number":[111],"such":[113],"computational":[117],"complexity":[118],"checking":[120],"fairness.":[121]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}