![](/img/cover-not-exists.png)
Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
R. M. Kolpakov, M. A. PosypkinVolume:
50
Language:
english
Pages:
10
DOI:
10.1134/s106423071105011x
Date:
October, 2011
File:
PDF, 456 KB
english, 2011