Kruger, MF; Hattingh, JM; Steyn, T
(2000)
The Knapsack Problem is one of the most important problems in Discrete
optimization. Although it is the simplest integer program, it has numerous practical
applications and often appears as a subproblem in solving more ...