Skip to main content
Log in

A parallel algorithm for the 0–1 knapsack problem

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

Research efforts on parallel exact algorithms for the 0–1 knapsack 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 branch-and-bound algorithm. We report results for our parallel algorithm on a transputer network for problems with up to 20,000 objects. The speedup obtained is nearly linear for 2, 4, and 8 processors except when there is a strong correlation between the profit and weight of the objects.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Martello and P. Toth, The 0–1 knapsak problem, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, (eds.),Combinatorial Optimization, John Wiley and Sons, p. 237–279 (1979).

  2. S. Martello and P. Toth, A new algorithm for the 0–1 knapsack problem,Management Science,34(5):633–644 (1988).

    Google Scholar 

  3. S. Martello and P. Toth,Knapsack Problems: Algorithms and Computer Implementations, John Wiley and Sons (1990).

  4. T. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms,Comm. of the ACM,27(6):594–602 (1984).

    Google Scholar 

  5. E. Horowitz and S. Sahni, Computing partitions with applications to the knapsack problem,Journal of the ACM,21, 277–292 (1974).

    Google Scholar 

  6. V. K. Janakiram, E. F. Gehringer, D. P. Agrawal, and R. Mehrotra, A randomized parallel branch-and-bound algorithm,IJPP,17(3):277–301 (1988).

    Google Scholar 

  7. G. A. P. Kindervater and H. W. J. M. Trienekens, Experiments with parallel algorithms for combinatorial problems,European Journal of Oper. Res.,33:65–81 (1988).

    Google Scholar 

  8. J. Lee, E. Shragowitz, and S. Sahni, A hypercube algorithm for the 0/1 knapsack problem,Journal of Parallel and Distributed Computing,5:438–456 (1988).

    Google Scholar 

  9. J. Lin and J. A. Storer, Processor-efficient hypercube algorithms for the knapsack problem,Journal of Parallel and Distributed Computing,13:332–337 (1991).

    Google Scholar 

  10. G. B. Dantzig, Discrete variable extremum problems,Operations Research,5:266–277 (1957).

    Google Scholar 

  11. O. I. El-Dessouki and W. H. Huen, Distributed enumeration on network computers,IEEE Trans. on Computers,C-29(9):818–825 (1980).

    Google Scholar 

  12. W. Loots and T. H. C. Smith, A parallel three phase sorting procedure for ak-dimensional hypercube and a transputer implementation,Parallel Computing,18: 335–344 (1992).

    Google Scholar 

  13. G. Casella and R. L. Berger,Statistical Inference, Wadsworth, California, (1990).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Loots, W., Smith, T.H.C. A parallel algorithm for the 0–1 knapsack problem. Int J Parallel Prog 21, 349–362 (1992). https://doi.org/10.1007/BF01407836

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01407836

Key Words

Navigation