Knapsack Problem Solver

Many of us have been faced with the classic knapsack problem before…

Looking to get the most out of his next jewellery store robbery, a thief has a list of the inventory with the weight and value of each item. His knapsack can only hold a given weight before it will rip. Given the weight limit of the knapsack what items should he take?..

This app has been designed to assist you with the challenging task of solving the three most common knapsack problems with an easy to use and simple to understand user interface. The 0-1, which restricts the quantity of each item to zero or one. Bounded, which removes the 0-1 restriction but limits the quantity to a specified value. And unbounded which removes all restrictions on quantity.


Key features:
- Solve all three problems simultaneously.
- Export results as PDF, CSV and plain text.
- Store items in groups for future reference and experimentation.