Marc Goerigk
Has participated in:
-
Robust combinatorial optimization problems under budgeted interdiction uncertainty
-
Robust Geometric Programming is co-NP hard
-
A New Bound for the Midpoint Solution in Minmax Regret Optimization with an Application to the Robust Shortest Path Problem
-
Alternative Formulations for the Ordered Weighted Averaging Objective