Decomposition based branch-and-bound algorithm

Scenario Decomposition Based Branch-and-Bound Algorithm... 

The performance of the hybrid ES is compared to that of the commercial MILP solver CPLEX and to that of the state-of-the-art scenario decomposition based branch-and-bound algorithm described in Section 9.3.5 (DDSIP). The results are shown in Figure 9.15. As the reference for the performance of hybrid ES, we take the median from the experiment with feasible initialization (Figure 9.14b). 

---