10 citations · 38 across the 10 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024★ 2 cited
On the Complexity of the Bilevel Shortest Path Problem
Dorothee Henke, Lasse Wulf
We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our pr…
math.OC2024
On Coupling Constraints in Linear Bilevel Optimization
Dorothee Henke, Henri Lefebvre, Martin Schmidt +1
It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there…
math.OC2024★ 1 cited
The Robust Bilevel Selection Problem
Dorothee Henke
In bilevel optimization problems, a leader and a follower make their decisions in a hierarchy, and both decisions may influence each other. Usually one assumes that both players ha…