2 papers
math.OC2026
Complexity of partitioned-items response problems: matchings and perfect matchings
Christoph Buchheim, Lowig Duer, Eva Ley +2
We consider bilevel optimization problems in which leader and follower jointly construct a feasible solution for an underlying combinatorial optimization problem. Response problems…
math.OC2025
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
Christoph Buchheim
It is a well-known result that bilevel linear optimization is NP-hard. In many publications, reformulations as mixed-integer linear optimization problems are proposed, which sugges…