Journal of Parallel and Distributed Computing
Parallel time and space upper-bounds for the subset-sum problem
Theoretical Computer Science
Experiments with parallel branch-and-bound algorithms for the set covering problem
Operations Research Letters
Branch-and-bound and parallel computation: A historical note
Operations Research Letters
Hi-index | 0.05 |