Investigation of algorithms for parallel computations in knapsack-type discrete optimization problems

Efficient parallel implementation of the branch-and-bound method in discrete optimization problems is considered. A description of particular algorithms and of their implementation is given. Based on experimental data, conclusions concerning the efficiency of those algorithms are drawn and factors affecting their performance are investigated.