10 citations · 42 across the 47 of their papers we have counts for
Showing 2021 · math.OCShow all
2 papers · 2 filters
math.OC2021
Combinatorial Optimization Problems with Balanced Regret
Marc Goerigk, Michael Hartisch
For decision making under uncertainty, min-max regret has been established as a popular methodology to find robust solutions. In this approach, we compare the performance of our so…
math.OC2021
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty
Marc Goerigk, Stefan Lendl, Lasse Wulf
We consider two-stage robust optimization problems, which can be seen as games between a decision maker and an adversary. After the decision maker fixes part of the solution, the a…