Description: At 0/1 knapsack problem, there is a need for a capacity of c to load the backpack. N items from a selected items into the backpack, each item i the weight wi, the value of pi. Feasible for loading backpack, backpack in the total weight of items should not exceed the capacity of backpack, the best means by loading items into the highest value.
To Search:
File list (Check if you may need any files):
0-1
...\bag.cpp
...\bag.dsp
...\bag.dsw
...\bag.ncb
...\bag.opt
...\bag.plg
...\Debug
...\.....\bag.exe
...\.....\bag.ilk
...\.....\bag.obj
...\.....\bag.pch
...\.....\bag.pdb
...\.....\vc60.idb
...\.....\vc60.pdb
Download