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.OC2026
On the feasibility of generalized inverse linear programs
Christoph Buchheim, Lowig T. Duer
We investigate the feasibility problem for generalized inverse linear programs. Given an LP with affinely parametrized objective function and right-hand side as well as a target se…