We address robust versions of combinatorial optimization problems, specializing on the discrete scenario case and the uncorrelated ellipsoidal uncertainty case. We present a branch and bound-algorithm for the min-max variant of these problems which uses lower bounds obtained from Lagrangean decomposition, allowing to separate the uncertainty aspect in the objective function from the combinatorial structure of the feasible set. For addressing the unrestricted binary subproblems arising in the uncorrelated ellipsoidal uncertainty case and in the twoscenario case, we devise fast combinatorial algorithms, where in the latter case we resort to solving a relaxation of the problem. In an extensive experimental evaluation we apply this approach to the robust versions of knapsack, shortest path, and minimum spanning tree problems. The results show that our approach clearly outperforms other solution methods in the uncorrelated ellipsoidal uncertainty case, as well as in the twoscenario case when the underlying problem is not given by a compact linear description.
View A Lagrangean Decomposition Approach for Robust Combinatorial Optimization