Top "Knapsack-problem" questions

The knapsack problem is a problem in combinatorial optimization: Given a set of items with associated weights and values, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and it maximizes the total value.

Knapsack with multiple bags and items having only weight

I am trying to solve this problem and I wanted to know if there are known existing algorithms / solutions to …

algorithm knapsack-problem
OpenMP - Nested for-loop becomes faster when having parallel before outer loop. Why?

I'm currently implementing an dynamic programming algorithm for solving knapsack problems. Therefore my code has two for-loops, an outer and …

c++ for-loop nested openmp knapsack-problem
Variation on knapsack - minimum total value exceeding 'W'

Given the usual n sets of items (each unlimited, say), with weights and values: w1, v1 w2, v2 ... wn, vn …

algorithm knapsack-problem