Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound methodстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 9 декабря 2020 г.
Аннотация:An easily implementable recursive parallelization strategy for solving the subset sum problem by the branch-and-bound method is proposed. Two different frontal and balanced variants of this strategy are compared. On an example of a particular case of the subset sum problem we show that the balancedvariant is more effective than the frontal one. Moreover, we show that, for the considered particular case of the subset sum problem, the balanced variant is also time optimal.