- Category:
- Data structs
- Tags:
-
- File Size:
- 221kb
- Update:
- 2014-01-10
- Downloads:
- 0 Times
- Uploaded by:
- 李五
Description: Suppose there are n items, each item has its own weight W1, W2, ... , Wn and the corresponding value of V1, V2, ......, Vn. Let knapsack capacity is c, under the premise of not exceeding the capacity of the backpack, find solutions to maximize the total value. (0-1 backpack case of indivisible goods, can only choose placed or not placed in a backpack).
To Search:
File list (Check if you may need any files):
0-1背包实验报告.docx
Download