Yasmine Beck is an Assistant Professor of Operations Management in the OPAC Group at Eindhoven University of Technology. Her research focuses on mathematical optimization, with particular emphasis on hierarchical optimization and optimization under uncertainty. She develops mathematical models and algorithmic solution methods, including exact and heuristic approaches, for challenging optimization problems such as mixed-integer bilevel and robust problems. She is particularly interested in applications in transportation and security-critical operations.
Research Interests
- Bilevel Optimization
- Robust Optimization
- Mixed-Integer Optimization
- Applications in Transportation and Security
Education
-
PhD in Mathematical Optimization, 2024
Trier University, Germany -
Master of Science in Applied Mathematics, 2020
Trier University, Germany -
Bachelor of Science in Business Mathematics, 2019
Trier University, Germany
Yasmine Beck is an Assistant Professor of Operations Management in the OPAC Group at Eindhoven University of Technology. Her research focuses on mathematical optimization, with particular emphasis on hierarchical optimization and optimization under uncertainty. She develops mathematical models and algorithmic solution methods, including exact and heuristic approaches, for challenging optimization problems such as mixed-integer bilevel and robust problems. She is particularly interested in applications in transportation and security-critical operations.
Research Interests
- Bilevel Optimization
- Robust Optimization
- Mixed-Integer Optimization
- Applications in Transportation and Security
Education
-
PhD in Mathematical Optimization, 2024
Trier University, Germany -
Master of Science in Applied Mathematics, 2020
Trier University, Germany -
Bachelor of Science in Business Mathematics, 2019
Trier University, Germany
News
- May 6, 2026: Our new preprint Exact Methods for Solving $k$-Delete Recoverable Robust $0$-$1$ Problems Under Budgeted Uncertainty (jointly with Christina Büsing and Ivana Ljubić) is now online! You can find it here.
- April 22, 2026: Excited to share a major milestone: our book Linear and Mixed-Integer Bilevel Optimization: Theory and Algorithms (jointly with Ivana Ljubić and Martin Schmidt) will be published soon. You can already use the freely available pre-publication version. This material will be published by Cambridge University Press as "Linear and Mixed-Integer Bilevel Optimization: Theory and Algorithms" by Yasmine Beck, Ivana Ljubić, and Martin Schmidt. This pre-publication version is free to view and download for personal use only. Not for re-distribution, re-sale, or use in derivative works. © Yasmine Beck, Ivana Ljubić, and Martin Schmidt 2026.
- March 16, 2026: Today, I presented our work on Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty (jointly with Christina Büsing and Ivana Ljubić) at the CIRM Workshop "Optimization at the Second Level" in Marseille. The preprint will appear soon!
- March 13, 2026: Our new preprint Modeling Network Congestion under Demand Uncertainty Using Wardrop Principles (jointly with Francesca Giancola, Ivana Ljubić and Sara Mattia) is online! You can find it here.
- March 5, 2026: Today, I gave the talk On Decision Uncertainty in Bilevel Optimization: Perception and Solution Errors in Follower Responses at the Mathematics Online Seminar Series (MOSS). Missed it? The recording will be available on YouTube soon.