The included code and solution write-up provides a parallel solution for the bounded knapsack problem, as described in the included problem description text file.
Brute-force algorithms Greedy algorithms Divide-and-conquer Backtracking Branch-and-bound Heuristics
The concept of recursion Recursive mathematical functions Simple recursive functions Divide-and-conquer strategies Recursive backtracking
Amortized analysis Online and offline algorithms Randomized algorithms Dynamic programming Combinatorial optimization
For more complete information about compiler optimizations, see our Optimization Notice.