10 citations · 42 across the 47 of their papers we have counts for
6 papers · 1 filter
Min-Max-Min Robustness for Combinatorial Problems with Discrete Budgeted Uncertainty
Marc Goerigk, Jannis Kurtz, Michael Poss
We consider robust combinatorial optimization problems with cost uncertainty where the decision maker can prepare K solutions beforehand and chooses the best of them once the true…
The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods
Trivikram Dokka, Marc Goerigk
We study the multi-level bottleneck assignment problem (MBA), which has important applications in scheduling and quantitative finance. Given a weight matrix, the task is to rearran…
Flexible here-and-now decisions for two-stage multi-objective optimization: Method and application to energy system design selection
Dinah Elena Hollermann, Marc Goerigk, Dörthe Franzisca Hoffrogge +2
The synthesis of energy systems is a two-stage optimization problem where design decisions have to be implemented here-and-now (first stage), while for the operation of installed c…
Robust two-stage combinatorial optimization problems under convex uncertainty
Marc Goerigk, Adam Kasperski, Pawel Zielinski
In this paper a class of robust two-stage combinatorial optimization problems is discussed. It is assumed that the uncertain second stage costs are specified in the form of a conve…
Mixed Uncertainty Sets for Robust Combinatorial Optimization
Trivikram Dokka, Marc Goerigk, Rahul Roy
In robust optimization, the uncertainty set is used to model all possible outcomes of uncertain parameters. In the classic setting, one assumes that this set is provided by the dec…
A Comparison of Models for Uncertain Network Design
Francis Garuba, Marc Goerigk, Peter Jacko
To solve a real-world problem, the modeler usually needs to make a trade-off between model complexity and usefulness. This is also true for robust optimization, where a wide range…