A parallel algorithm for the 0-1 knapsack problem
- Rand Afrikaans Univ., Johannesburg (South Africa)
Research efforts on parallel exact algorithms for the 0-1 knapsak problem have up to now concentrated on solving small problems (at most 1,000 objects) and in many cases results have only been obtained by simulation of the parallel algorithm. After a brief review of a well known sequential branch-and-bound algorithm we discuss a new parallel algorithm for the 0-1 knapsack problem which exploits the potential parallelism that exists during the backtracking steps of the brank-and-bound algorithm. We report results for our parallel algorithm on a transputer network for problems with up to 20,000 objects. The speedup obtain is nearly linear for 2, 4, and 8 processors except when there is a strong correlation between the profit and weight of the objects.
- OSTI ID:
- 7245189
- Journal Information:
- International Journal of Parallel Programming; (United States), Journal Name: International Journal of Parallel Programming; (United States) Vol. 21:5; ISSN IJPPE5; ISSN 0885-7458
- Country of Publication:
- United States
- Language:
- English
Similar Records
A hypercube algorithm for the 0/1 knapsack problem
Adaptive parallel algorithms for integral knapsack problems