8 citations · 17 across the 13 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
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…
math.OC2019
Oracle-Based Algorithms for Binary Two-Stage Robust Optimization
Nicolas Kämmerling, Jannis Kurtz
In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-sta…
math.OC2019
Discrete Optimization Methods for Group Model Selection in Compressed Sensing
Bubacarr Bah, Jannis Kurtz, Oliver Schaudt
In this article we study the problem of signal recovery for group models. More precisely for a given set of groups, each containing a small subset of indices, and for given linear…