The following pages link to Mikhail A. Posypkin (Q828197):
Displaying 5 items.
- (Q220316) (redirect page) (← links)
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149) (← links)
- Comparison of parallel implementations of the branch-and-bound method for shared memory systems (Q6178124) (← links)
- Speedup estimates for some variants of the parallel implementations of the branch-and-bound method (Q6200659) (← links)
