Management Science, Vol. 45, No. 3 (Mar., 1999), pp. 414-424 (11 pages) Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This ...

This paper shows how branch-and-bound methods can be used to reduce storage and, possibly, computational requirements in discrete dynamic programs. Relaxations and fathoming criteria are used to ...