{"id":"https://openalex.org/W2745660793","doi":"https://doi.org/10.1137/16m1098486","title":"Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs","display_name":"Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2745660793","doi":"https://doi.org/10.1137/16m1098486","mag":"2745660793"},"language":"en","primary_location":{"id":"doi:10.1137/16m1098486","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1098486","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/130604","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077565920","display_name":"\u0130hsan Yan\u0131ko\u011flu","orcid":"https://orcid.org/0000-0002-7216-4739"},"institutions":[{"id":"https://openalex.org/I44925452","display_name":"\u00d6zye\u011fin University","ror":"https://ror.org/01jjhfr75","country_code":"TR","type":"education","lineage":["https://openalex.org/I44925452"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"\u0130hsan Yan\u0131ko\u011flu","raw_affiliation_strings":["Industrial Engineering Department, \u00d6zyegin University, \u0130stanbul, Turkey -"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, \u00d6zyegin University, \u0130stanbul, Turkey -","institution_ids":["https://openalex.org/I44925452"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065780980","display_name":"Daniel K\u00fchn","orcid":"https://orcid.org/0000-0003-2697-8886"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Daniel Kuhn","raw_affiliation_strings":["Risk Analytics and Optimization Chair, EPFL, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Risk Analytics and Optimization Chair, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077565920"],"corresponding_institution_ids":["https://openalex.org/I44925452"],"apc_list":null,"apc_paid":null,"fwci":2.2802,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.88261607,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":"1","first_page":"198","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9943000078201294,"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"}},{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9811000227928162,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.8096580505371094},{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.8007128238677979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6755945086479187},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6568979620933533},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5435043573379517},{"id":"https://openalex.org/keywords/decision-rule","display_name":"Decision rule","score":0.5227042436599731},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5175523161888123},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4929203987121582},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.437274307012558},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.42668479681015015},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3416721522808075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27270063757896423},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.22509890794754028},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1729612648487091},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10380980372428894}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8096580505371094},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.8007128238677979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6755945086479187},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6568979620933533},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5435043573379517},{"id":"https://openalex.org/C84839998","wikidata":"https://www.wikidata.org/wiki/Q5249245","display_name":"Decision rule","level":2,"score":0.5227042436599731},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5175523161888123},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4929203987121582},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.437274307012558},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.42668479681015015},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3416721522808075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27270063757896423},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.22509890794754028},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1729612648487091},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10380980372428894},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/16m1098486","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1098486","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:eresearch.ozyegin.edu.tr:10679/5989","is_oa":false,"landing_page_url":"http://hdl.handle.net/10679/5989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:infoscience.tind.io:222470","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/130604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"research article"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:222470","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/130604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5124864","host_organization_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","host_organization_lineage":["https://openalex.org/I5124864"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"research article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.800000011920929,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1790531393","display_name":null,"funder_award_id":"115C100","funder_id":"https://openalex.org/F4320322626","funder_display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu"},{"id":"https://openalex.org/G2867641314","display_name":"Optimization under Unknown or Uncertain Uncertainty (Optimization4U)","funder_award_id":"157733","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320322626","display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","ror":"https://ror.org/04w9kkr77"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1588628884","https://openalex.org/W1964986866","https://openalex.org/W1969144048","https://openalex.org/W1974549991","https://openalex.org/W1983644172","https://openalex.org/W1990365716","https://openalex.org/W2000508521","https://openalex.org/W2003319448","https://openalex.org/W2013365934","https://openalex.org/W2014923785","https://openalex.org/W2015347870","https://openalex.org/W2015978854","https://openalex.org/W2018851374","https://openalex.org/W2029376758","https://openalex.org/W2031264011","https://openalex.org/W2031279008","https://openalex.org/W2042422381","https://openalex.org/W2043157166","https://openalex.org/W2045089402","https://openalex.org/W2045540560","https://openalex.org/W2056831000","https://openalex.org/W2066642748","https://openalex.org/W2068275322","https://openalex.org/W2069737635","https://openalex.org/W2078135889","https://openalex.org/W2080474145","https://openalex.org/W2082477992","https://openalex.org/W2087693625","https://openalex.org/W2088448948","https://openalex.org/W2102686659","https://openalex.org/W2116509768","https://openalex.org/W2119303899","https://openalex.org/W2142092335","https://openalex.org/W2150459262","https://openalex.org/W2162885967","https://openalex.org/W2163542858","https://openalex.org/W2536620281","https://openalex.org/W2591884505","https://openalex.org/W3143187486"],"related_works":["https://openalex.org/W1588628884","https://openalex.org/W1994745260","https://openalex.org/W2012267561","https://openalex.org/W2382404424","https://openalex.org/W4237041411","https://openalex.org/W4300511218","https://openalex.org/W3018909868","https://openalex.org/W1781970900","https://openalex.org/W2898988404","https://openalex.org/W2102926716"],"abstract_inverted_index":{"We":[0],"study":[1],"two-stage":[2],"stochastic":[3],"bilevel":[4],"programs":[5,56],"where":[6],"the":[7,15,44],"leader":[8],"chooses":[9],"a":[10,19,40,69],"binary":[11],"here-and-now":[12],"decision":[13,25],"and":[14,36,75],"follower":[16],"responds":[17],"with":[18,77],"continuous":[20],"wait-and-see":[21],"decision.":[22],"Using":[23],"modern":[24],"rule":[26],"approximations,":[27],"we":[28],"construct":[29],"lower":[30],"bounds":[31,38],"on":[32,39],"an":[33],"optimistic":[34],"version":[35,42],"upper":[37],"pessimistic":[41],"of":[43],"leader's":[45],"problem.":[46],"Both":[47],"bounding":[48],"problems":[49],"are":[50,58],"equivalent":[51],"to":[52,60],"explicit":[53],"mixed-integer":[54],"linear":[55],"that":[57],"amenable":[59],"efficient":[61],"numerical":[62],"solution.":[63],"The":[64],"method":[65],"is":[66],"illustrated":[67],"through":[68],"facility":[70],"location":[71],"problem":[72],"involving":[73],"sellers":[74],"customers":[76],"conflicting":[78],"preferences.":[79]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2017-08-31T00:00:00"}