Skip to main content
SpringerLink
Log in

Algorithm 37 Algorithm for the solution of the 0–1 single knapsack problem

Algorithmus 37. Algorithmus für die Lösung des „0–1 single Knapsack Problems”

  • Algorithms
  • Published:
Computing Aims and scope Submit manuscript

Abstract

The FORTRAN implementation of an efficient algorithm which solves the 0–1 single knapsack problem is given. Computational results are presented, showing the proposed method to be generally superior to the best known algorithms.

Zusammenfassung

Für das „0–1 single Knapsack Problem” wird eine FORTRAN-Implementierung eines wirkungsvollen Lösungsverfahrens angegeben. Die angeführten Rechenergebnisse zeigen, daß die vorgeschlagene Methode den derzeit besten bekannten Algorithmen überlegen ist.

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

Access this article

Log in via an institution

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. Horowitz, E., Sahni, S.: Computing Partitions with Applications to the Knapsack Problem. Journal of ACM21, 277–292 (1974).

    Google Scholar 

  2. Ingargiola, G. P., Korsh, J. F.: Reduction Algorithm for Zero-One Single Knapsack Problems. Management Science20, 460–463 (1973).

    Google Scholar 

  3. Martello, S., Toth, P.: An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm. European Journal of Operational Research1, 169–175 (1977).

    Google Scholar 

  4. Martello, S., Toth, P.: A Computational Study on Large-Size Unidimensional Knapsack Problems. Presented at the TIMS/ORSA Joint National Meeting, San Francisco (1977).

  5. Nauss, R. M.: An Efficient Algorithm for the 0–1 Knapsack Problem. Management Science23, 27–31 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Automatica, University of Bologna, Viale Risorgimento, 2, I-40126, Bologna, Italy

    S. Martello &  P. Toth

Authors
  1. S. Martello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Toth
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martello, S., Toth, P. Algorithm 37 Algorithm for the solution of the 0–1 single knapsack problem. Computing 21, 81–86 (1978). https://doi.org/10.1007/BF02252196

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation