| 0/1背包问题的贪心算法 |
| |
| 引用本文： | 黄宇林. 0/1背包问题的贪心算法[J]. 鄂州大学学报, 2006, 13(6): 38-40 |
| |
| 作者姓名： | 黄宇林 |
| |
| 作者单位： | 鄂州大学,基础科学系,湖北,鄂州,436000 |
| |
| 摘 要： | 0／1背包问题属于动态规划问题，部分背包问题属于贪心算法的范畴，通过比较两种算法的联系和区别，来寻求0／1背包问题的贪心算法的条件，用贪心算法来解决部分0／1背包问题的求解。
|
| 关 键 词： | 动态规划 贪心算法 0/1背包问题 |
| 文章编号： | 1008-9004（2006）06-0038-03 |
| 收稿时间： | 2006-02-14 |
| 修稿时间： | 2006-02-14 |
Greedy algorithm for the solution of the question of 0/1 knapsack |
| |
| HUANG Yu-lin. Greedy algorithm for the solution of the question of 0/1 knapsack[J]. Journal of Ezhou University, 2006, 13(6): 38-40 |
| |
| Authors: | HUANG Yu-lin |
| |
| Affiliation: | Basic Science Department, Ezhou University, Ezhou, Hubei 436000, China |
| |
| Abstract: | The question of 0/1 knapsack is solved through dynamic planning, but part of such a problem can be solved by greedy algorithm. Explaining the differences and similarities of the above two methods, the article aims to elaborate the conditions where the question of 0/1 knapsack can be solved by greedy algorithm. |
| |
| Keywords: | dynamic planning greedy algorithm the question of 0/1 knapsack |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
