Browsing Department of Computer Science by Title "Revisiting sparse dynamic programming for the 0/1 Knapsack Problem"
Now showing items 1-1 of 1
The 0/1-Knapsack Problem is a classic NP-hard problem. There are two common approaches to obtain the exact solution: branch-and-bound (BB) and dynamic programming (DP). A socalled, "sparse" DP algorithm (SKPDP) that performs ...