[图书][B] An asynchronous parallel benders decomposition method

R Rahmaniani, TG Crainic, M Gendreau, W Rei - 2019 - researchgate.net
Benders decomposition (BD) is one of the most popular solution algorithms for stochastic
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 …

An asynchronous parallel benders decomposition method for stochastic network design problems

R Rahmaniani, TG Crainic, M Gendreau… - Computers & Operations …, 2024 - Elsevier
Benders decomposition (BD) is one of the most popular solution algorithms for stochastic
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 an extremely
inefficient parallel algorithm due to excessive idle times. On the other hand, relaxing the …
以上显示的是最相近的搜索结果。 查看全部搜索结果