Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
Year of publication: |
2023
|
---|---|
Authors: | Buchheim, Christoph |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 6, p. 618-622
|
Subject: | Bilevel linear programming | KKT-reformulation | NP-completeness | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
New and simple algorithms for stable flow problems
Cseh, Ágnes, (2018)
-
Finding clique clusters with the highest betweenness centrality
Rysz, Maciej, (2018)
-
Strong NP-hardness of AC power flows feasibility
Bienstock, Daniel, (2019)
- More ...
-
Nachruf: Zum Tod von Christoph Buchheim (1954 - 2009)
Rudolph, Bernd, (2010)
-
Stöttner, Rainer, (1986)
-
Buchheim, Christoph, (1988)
- More ...