4 papers
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…
On the Complexity of Bilevel Independent Set Problem
Komal Muluk
We consider a bilevel optimization problem in which the ground set is partitioned between two decision makers, a leader and a follower, whose optimization problems are interleaved.…
Make a graph singly connected by edge orientations
Tim A. Hartmann, Komal Muluk
A directed graph is singly connected if for every ordered pair of vertices , there is at most one path from to in . Graph orientation problems ask, given an u…
Recoverable Robust Optimization with Commitment
Felix Hommelsheim, Nicole Megow, Komal Muluk +1
We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that may fail, we ask for a robust…