3 citations · 3 across the 4 of their papers we have counts for
5 papers
Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty
Yasmine Beck, Christina Büsing, Ivana Ljubić
We study the k-delete recoverable robust 0-1 problem in which a decision-maker solves a combinatorial optimization problem subject to objective uncertainty. The model follows a two…
Modeling Network Congestion under Demand Uncertainty Using Wardrop Principles
Yasmine Beck, Francesca Giancola, Ivana Ljubić +1
Motivated by the need for reliable traffic management under fluctuating travel demand, we study the problem of determining the worst-case congestion in a multi-commodity traffic ne…
Exact and Heuristic Methods for -Robust Min-Max Problems
Yasmine Beck
Bilevel optimization is a powerful tool for modeling hierarchical decision-making processes, which arise in various real-world applications. Due to their nested structure, however,…
A Brief Introduction to Robust Bilevel Optimization
Yasmine Beck, Ivana Ljubić, Martin Schmidt
Bilevel optimization is a powerful tool for modeling hierarchical decision making processes. However, the resulting problems are challenging to solve - both in theory and practice.…
On a Computationally Ill-Behaved Bilevel Problem with a Continuous and Nonconvex Lower Level
Yasmine Beck, Daniel Bienstock, Martin Schmidt +1
It is well known that bilevel optimization problems are hard to solve both in theory and practice. In this paper, we highlight a further computational difficulty when it comes to s…