integer programs. The BD method decomposes stochastic problems into one master
problem and multiple disjoint subproblems. It thus lends itself readily to parallelization. In
almost all studies on the parallelization of this algorithm, the master problem remains idle
until every subproblem is solved and vice versa. This can clearly result in having an
extremely inefficient parallel algorithm due to excessive idle times. On the other hand …