Showing 2018Show all
3 papers · 1 filter
cs.DS2018
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…
math.OC2018
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…
math.OC2018
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…