Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4962283 | Procedia Computer Science | 2016 | 6 Pages |
Abstract
The paper considers efficient computational load distribution for the exact parallel algorithm for the knapsack problem based on packing tree search. We propose an algorithm that provides for static and dynamic computational load balancing for the problem in question.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Mikhail A. Kupriyashin, Georgii I. Borzunov,