An Efficient Algorithm for the 0-1 Knapsack Problem
- 1 September 1976
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 23 (1) , 27-31
- https://doi.org/10.1287/mnsc.23.1.27
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.Keywords
This publication has 0 references indexed in Scilit: