![](/img/cover-not-exists.png)
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
R. M. Kolpakov, M. A. Posypkin, I. Kh. SigalVolume:
71
Language:
english
Pages:
10
DOI:
10.1134/s0005117910100140
Date:
October, 2010
File:
PDF, 147 KB
english, 2010