• Revisiting sparse dynamic programming for the 0/1 Knapsack Problem 

        Contributor:Sifat, Tarequl Islam;
        Date Submitted:2019
        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 ...