An Efficient Algorithm for the 0-1 Knapsack Problem

Robert M. Nauss
Additional contact information
Robert M. Nauss: University of Missouri-St. Louis

Management Science, 1976, vol. 23, issue 1, 27-31

Abstract: In this note we present an efficient algorithm for the 0-1 knapsack problem and announce the availability of a callable FORTRAN subroutine which solves this problem. Computational results show that 50 variable problems can be solved in an average of 4 milliseconds and 200 variable problems in an average of 7 milliseconds on an IBM 360/91.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.1.27 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:23:y:1976:i:1:p:27-31

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().