This Knapsack problem is my group assignment for these next four weeks. My goal is to create an algorithm that can beat the fast speed currently available for this problem. Currently it runs very slow at an exponential pace. The results from my equation to figure out the best possible choice of items relative to weight and value, are displayed in the chart above. Remember that the best possible scenario would be to maximize value and minimize weight.
- Scaled Value to Weight
- Weight
- Value
Download here: