1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.OC2019
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…
cs.DS2019★ 1 cited
Approximation results for makespan minimization with budgeted uncertainty
Marin Bougeret, Klaus Jansen, Michael Poss +1
We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the model we consider, which…