3 citations · 8 across the 30 of their papers we have counts for
7 papers · 1 filter
Two-stage Combinatorial Optimization Problems under Risk
Marc Goerigk, Adam Kasperski, Pawel Zielinski
In this paper a class of combinatorial optimization problems is discussed. It is assumed that a solution can be constructed in two stages. The current first-stage costs are precise…
Generating Hard Instances for Robust Combinatorial Optimization
Marc Goerigk, Stephen J. Maher
While research in robust optimization has attracted considerable interest over the last decades, its algorithmic development has been hindered by several factors. One of them is a…
A Largest Empty Hypersphere Metaheuristic for Robust Optimisation with Implementation Uncertainty
Martin Hughes, Marc Goerigk, Michael Wright
We consider box-constrained robust optimisation problems with implementation uncertainty. In this setting, the solution that a decision maker wants to implement may become perturbe…
Approximating multiobjective combinatorial optimization problems with the OWA criterion
André Chassein, Marc Goerigk, Adam Kasperski +1
The paper deals with a multiobjective combinatorial optimization problem with linear cost functions. The popular Ordered Weighted Averaging (OWA) criterion is used to aggregate…
Constructing Representative Scenarios to Approximate Robust Combinatorial Optimization Problems
Marc Goerigk
In robust combinatorial optimization with discrete uncertainty, two general approximation algorithms are frequently used, which are both based on constructing a single scenario rep…
Algorithms and Uncertainty Sets for Data-Driven Robust Shortest Path Problems
André Chassein, Trivikram Dokka, Marc Goerigk
We consider robust shortest path problems, where the aim is to find a path that optimizes the worst-case performance over an uncertainty set containing all relevant scenarios for a…