4 citations · 5 across the 12 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
Adaptive Relaxations for Multistage Robust Optimization
Michael Hartisch
Multistage robust optimization problems can be interpreted as two-person zero-sum games between two players. We exploit this game-like nature and utilize a game tree search in orde…