Knapsack Problem

This project is a Knapsack Problem represent by the classic program. How much the max value that the bag can contain with the max weight.

Knapsack Problem

How to :
The input parameter is
1. max weight of the bag
2. max item
3. value
4. weight
PS : you can enter the both parameter to together (20 15 -> value 20: weight 15)
Enter all value then the program return the result of max value.

Tools & Knowledge :
1. C++
2. Knapsack Problem

Reqirement :
1. Microsoft .Net Framework 2.0 (22.4 MB)
2. windows

Download :
1. Knapsack Problem