9 citations · 10 across the 7 of their papers we have counts for
8 papers
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…
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…
Faster Algorithms for Min-max-min Robustness for Combinatorial Problems with Budgeted Uncertainty
André Chassein, Marc Goerigk, Jannis Kurtz +1
We consider robust combinatorial optimization problems where the decision maker can react to a scenario by choosing from a finite set of solutions. This approach is appropriate…
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty
André Chassein, Marc Goerigk, Adam Kasperski +1
In this paper the problem of selecting out of available items is discussed, such that their total cost is minimized. We assume that costs are not known exactly, but stem fr…
On Scenario Aggregation to Approximate Robust Optimization Problems
Marc Goerigk, André Chassein
As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has be…
Compromise Solutions for Robust Combinatorial Optimization with Variable-Sized Uncertainty
André Chassein, Marc Goerigk
In classic robust optimization, it is assumed that a set of possible parameter realizations, the uncertainty set, is modeled in a previous step and part of the input. As recent wor…