Algorithm 37

Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem. 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.