An improved direct descent algorithm for binary knapsack problems

Several efficient algorithms for solution of the binary knapsack problem have appeared in the literature. The direct descent algorithm is generally recognized as one of the most efficient. This paper improves the direct descent algorithm through a more general fathom and backtrack methodology and stronger reduction tests. The efficiency of these improvements is verified through extensive computational testing.