- Category:
- Algorithm
- Tags:
-
- File Size:
- 34kb
- Update:
- 2013-12-05
- Downloads:
- 0 Times
- Uploaded by:
- 吴双双
Description: The 0-1 knapsack problem: N items and a capacity of V backpack. Take the first I items is c[i], the value is w[i]. For which goods loaded backpack can make the value of the sum of the maximum.
To Search:
File list (Check if you may need any files):
0-1bag.docx
Download