Statement
The knapsack problem
Given
objects with weight and value how do we maximise the value of a bag that can carry weight . The solution to this is a subset of objects such that:
, and - it maximises its value
.
Solutions
- First solution
- run time
The knapsack problem
Given
objects with weight and value how do we maximise the value of a bag that can carry weight . The solution to this is a subset of objects such that:
, and - it maximises its value
.