1 paper
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…