Statement

Knapsack-search (without replacement)

Given objects with weight and value , and a goal is there a bag that has weight less than but value at least . The solution to this is a subset of objects such that:

  • , and
  • .

If there is such a bag what is it otherwise say there is no such solution.

Solutions

  • First solution
    • run time

Theory

Related problems