A new enumeration scheme for the knapsack problem (Q1095029): Difference between revisions

This paper presents a new enumeration scheme to solve the one-dimensional knapsack problem motivated by some observations on number theory, more specifically on the determination of the number of solutions of linear diophantine equations. This new algorithm is pseudopolynomial and its special features provide a reduction in running time and in the computational memory requirements as compared with other exact (dynamic programming) methods.