Description: Solve the knapsack problem with vc6.0. Species of a given n items and a backpack. The weight of item i is wi, the value of pi, the capacity of backpack m. Asked should be how to choose the items into the backpack, the backpack load in the largest total value of goods
To Search:
File list (Check if you may need any files):
bag.cpp
Download