{"id":"https://openalex.org/W2046542460","doi":"https://doi.org/10.1137/0911017","title":"A Branch and Bound Algorithm for the Bilevel Programming Problem","display_name":"A Branch and Bound Algorithm for the Bilevel Programming Problem","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2046542460","doi":"https://doi.org/10.1137/0911017","mag":"2046542460"},"language":"en","primary_location":{"id":"doi:10.1137/0911017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0911017","pdf_url":null,"source":{"id":"https://openalex.org/S4210181992","display_name":"SIAM Journal on Scientific and Statistical Computing","issn_l":"0196-5204","issn":["0196-5204","2168-3417"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 Scientific and Statistical Computing","raw_type":"journal-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/A5020565600","display_name":"Jonathan F. Bard","orcid":"https://orcid.org/0000-0001-8569-0909"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonathan F. Bard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108785888","display_name":"James T. Moore","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James T. Moore","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.9745,"has_fulltext":false,"cited_by_count":411,"citation_normalized_percentile":{"value":0.97688015,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"11","issue":"2","first_page":"281","last_page":"292"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9987999796867371,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9822999835014343,"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/bilevel-optimization","display_name":"Bilevel optimization","score":0.9344127178192139},{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.8463132977485657},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7001815438270569},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6535042524337769},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5759932994842529},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.5274933576583862},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5228981375694275},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5146754384040833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.51118403673172},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4836200773715973},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4806029498577118},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.47185561060905457},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.4658328890800476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4411984980106354},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.306479811668396},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.140870600938797}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.9344127178192139},{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.8463132977485657},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7001815438270569},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6535042524337769},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5759932994842529},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.5274933576583862},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5228981375694275},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5146754384040833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.51118403673172},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4836200773715973},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4806029498577118},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.47185561060905457},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4658328890800476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4411984980106354},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.306479811668396},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.140870600938797},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0911017","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0911017","pdf_url":null,"source":{"id":"https://openalex.org/S4210181992","display_name":"SIAM Journal on Scientific and Statistical Computing","issn_l":"0196-5204","issn":["0196-5204","2168-3417"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 Scientific and Statistical Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W55700729","https://openalex.org/W1969368779","https://openalex.org/W1970855160","https://openalex.org/W2012948172","https://openalex.org/W2023858465","https://openalex.org/W2040158468","https://openalex.org/W2074145107","https://openalex.org/W2074376561","https://openalex.org/W2078101422","https://openalex.org/W2096126893","https://openalex.org/W2099958618","https://openalex.org/W2103394538","https://openalex.org/W2127587365","https://openalex.org/W2140145913","https://openalex.org/W2168706090"],"related_works":["https://openalex.org/W2366048656","https://openalex.org/W2335727710","https://openalex.org/W2131023196","https://openalex.org/W2079104779","https://openalex.org/W3046916097","https://openalex.org/W2046542460","https://openalex.org/W2016379082","https://openalex.org/W3046764739","https://openalex.org/W2786277681","https://openalex.org/W2962818638"],"abstract_inverted_index":{"The":[0,108],"bilevel":[1],"programming":[2],"problem":[3,42],"is":[4,21,46,69,80],"a":[5,49,91],"static":[6],"Stackelberg":[7],"game":[8],"in":[9,25,115,123],"which":[10],"two":[11],"players":[12],"try":[13],"to":[14,39,71,82,98],"maximize":[15],"their":[16],"individual":[17],"objective":[18],"functions.":[19],"Play":[20],"sequential":[22],"and":[23,61,67,86,105,122],"uncooperative":[24],"nature.":[26],"This":[27],"paper":[28,113],"presents":[29],"an":[30],"algorithm":[31],"for":[32,90],"solving":[33],"the":[34,41,55,73,84,112,116,120,124,127],"linear/quadratic":[35],"case.":[36],"In":[37],"order":[38],"make":[40],"more":[43],"manageable,":[44],"it":[45],"reformulated":[47],"as":[48],"standard":[50],"mathematical":[51],"program":[52],"by":[53,65],"exploiting":[54],"follower\u2019s":[56],"Kuhn\u2013Tucker":[57],"conditions.":[58,77],"A":[59],"branch":[60],"bound":[62],"scheme":[63],"suggested":[64],"Fortuny-Amat":[66],"McCarl":[68],"used":[70],"enforce":[72],"underlying":[74],"complementary":[75],"slackness":[76],"An":[78],"example":[79],"presented":[81],"illustrate":[83],"computations,":[85],"results":[87],"are":[88,114],"reported":[89],"wide":[92],"range":[93],"of":[94,111,119,126],"problems":[95],"containing":[96],"up":[97],"60":[99],"leader":[100],"variables,":[101,104],"40":[102,106],"follower":[103],"constraints.":[107],"main":[109],"contributions":[110],"step-by-step":[117],"details":[118],"implementation,":[121],"scope":[125],"testing.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":24},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":26},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":15}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}