Kolpakov M

M Kolpakov

Information about the author M Kolpakov will soon be added to the site.
Found 1 papers in total
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
2010
We study parallel complexity of the branch-and-bound method for optimization problems....
Papers per page: