{"id":"https://openalex.org/W1981704350","doi":"https://doi.org/10.1145/1569901.1570255","title":"Optimal robust expensive optimization is tractable","display_name":"Optimal robust expensive optimization is tractable","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W1981704350","doi":"https://doi.org/10.1145/1569901.1570255","mag":"1981704350"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1570255","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00374910","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042955148","display_name":"Philippe Rolet","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Philippe Rolet","raw_affiliation_strings":["TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France","TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France#TAB#"],"affiliations":[{"raw_affiliation_string":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002747181","display_name":"Mich\u00e8le S\u00e9bag","orcid":"https://orcid.org/0000-0002-8291-7706"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mich\u00e8le Sebag","raw_affiliation_strings":["TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France","TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France#TAB#"],"affiliations":[{"raw_affiliation_string":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034012952","display_name":"Olivier Teytaud","orcid":"https://orcid.org/0000-0001-5570-5209"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Teytaud","raw_affiliation_strings":["TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France","TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France#TAB#"],"affiliations":[{"raw_affiliation_string":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"TAO (Inria),Lri,Cnrs UMR 8623, u. Paris-Sud, France, Orsay, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042955148"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":2.7031,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.9057266,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1951","last_page":"1956"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9972000122070312,"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/computer-science","display_name":"Computer science","score":0.6199120283126831},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5787897706031799},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5777314901351929},{"id":"https://openalex.org/keywords/dynamical-billiards","display_name":"Dynamical billiards","score":0.5338194370269775},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5222495198249817},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5158244967460632},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4309004545211792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40509268641471863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3042396903038025}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6199120283126831},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5787897706031799},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5777314901351929},{"id":"https://openalex.org/C193605512","wikidata":"https://www.wikidata.org/wiki/Q2903467","display_name":"Dynamical billiards","level":2,"score":0.5338194370269775},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5222495198249817},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5158244967460632},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4309004545211792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40509268641471863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3042396903038025},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1569901.1570255","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:inria-00374910v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00374910","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gecco 2009, ACM, 2009, Montr\u00e9al, Canada. 8 p","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00374910v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00374910","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gecco 2009, ACM, 2009, Montr\u00e9al, Canada. 8 p","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1500868819","https://openalex.org/W1504812409","https://openalex.org/W1510052597","https://openalex.org/W1537152729","https://openalex.org/W1545886482","https://openalex.org/W1571673261","https://openalex.org/W1583555936","https://openalex.org/W1625390266","https://openalex.org/W1714211023","https://openalex.org/W1818963346","https://openalex.org/W1976503157","https://openalex.org/W2006565216","https://openalex.org/W2009551863","https://openalex.org/W2011418219","https://openalex.org/W2020135152","https://openalex.org/W2020732830","https://openalex.org/W2030796235","https://openalex.org/W2075848246","https://openalex.org/W2102251959","https://openalex.org/W2108114251","https://openalex.org/W2139539173","https://openalex.org/W2156361796","https://openalex.org/W2161244294","https://openalex.org/W2340946512","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2058697418","https://openalex.org/W1627627718","https://openalex.org/W3044371202","https://openalex.org/W4225685442","https://openalex.org/W4310285670","https://openalex.org/W2273579192","https://openalex.org/W2963158665","https://openalex.org/W2611989986","https://openalex.org/W2810195649","https://openalex.org/W2394724188"],"abstract_inverted_index":{"Following":[0],"a":[1,15,31,42,86,90],"number":[2],"of":[3,9,18,57],"recent":[4],"papers":[5],"investigating":[6],"the":[7,26,55,58,69,99],"possibility":[8],"optimal":[10],"comparison-based":[11,27],"optimization":[12],"algorithms":[13],"for":[14],"given":[16],"distribution":[17],"probability":[19],"on":[20,62,89],"fitness":[21],"functions,":[22],"we":[23],"(i)":[24],"discuss":[25],"constraints":[28],"(ii)":[29],"choose":[30],"setting":[32],"in":[33],"which":[34],"theoretical":[35],"tight":[36],"bounds":[37],"are":[38],"known":[39],"(iii)":[40],"develop":[41],"careful":[43],"implementation":[44],"using":[45],"billiard":[46],"algorithms,":[47],"Upper":[48],"Confidence":[49],"trees":[50],"and":[51,81],"(iv)":[52],"experimentally":[53],"test":[54],"tractability":[56],"approach.":[59],"The":[60],"results,":[61],"still":[63,72],"very":[64],"simple":[65],"cases,":[66],"show":[67],"that":[68],"approach,":[70],"yet":[71],"preliminary,":[73],"could":[74],"be":[75],"tested":[76],"successfully":[77],"until":[78],"dimension":[79],"10":[80],"horizon":[82],"50":[83],"iterations":[84],"within":[85],"few":[87],"hours":[88],"standard":[91],"computer,":[92],"with":[93],"convergence":[94],"rate":[95],"far":[96],"better":[97],"than":[98],"best":[100],"algorithms.":[101]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}