-based formulation derived by Dantzig-Wolfe decomposition and a branch-and-price algorithm. The computational experiments show that our … branch-and-price algorithm outperforms CPLEX in many cases, which solves the ordinary robust reformulation. We also examine …

Leader’s pessimistic optimal solution, we suggest an implicit enumeration algorithm, where a cut generation procedure is … efficiency of the algorithm’s ingredients …