arbiter
JournalsAccount

On the Complexity of Finding Locally Optimal Solutions in Bilevel Linear Optimization

Oleg A. Prokopyev & Ted K. Ralphs

Operations Research2026https://doi.org/10.1287/opre.2024.1411article
FT50UTD24AJG 4*ABDC A*
Weight
0.50

Abstract

On the Complexity of Finding Locally Optimal Solutions in Bilevel Linear Optimization

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1287/opre.2024.1411

Or copy a formatted citation

@article{oleg2026,
  title        = {{On the Complexity of Finding Locally Optimal Solutions in Bilevel Linear Optimization}},
  author       = {Oleg A. Prokopyev & Ted K. Ralphs},
  journal      = {Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1287/opre.2024.1411},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

On the Complexity of Finding Locally Optimal Solutions in Bilevel Linear Optimization

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.