- Category:
- Other systems
- Tags:
-
- File Size:
- 89kb
- Update:
- 2018-01-02
- Downloads:
- 0 Times
- Uploaded by:
- wj
Description: The greedy algorithm solves the knapsack problem: a given n item and a backpack. The weight of the item I is Wi, its value is Vi, and the capacity of the knapsack is C. How should we choose items packed into knapsack, so that the total value of goods packed into backpacks is the largest?
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 背包问题\背包问题.cpp | 2211 | 2017-12-27
|
| 背包问题\背包问题.docx | 105002 | 2018-01-01
|
| 背包问题 | 0 | 2018-01-01 |
Download