A Knapsack problem solution built using DCP
- Use the instructions found here to get started with DCP: https://docs.dcp.dev/intro/getting-setup.html
- Clone the repo
- Select the number of items to be added to the knapsack and the value and weight ranges
- Then press the find optimal button upload the keystore file from step 1 and wait for the red light next to the knapsack to turn green
- When it does it will display which items should be put in the knapsack for the maximum value