| 0-1背包问题及其算法分析 |
| |
| 引用本文： | 应莉. 0-1背包问题及其算法分析[J]. 计算机与现代化, 2009, 0(6) |
| |
| 作者姓名： | 应莉 |
| |
| 作者单位： | 金华职业技术学院,浙江,金华,321000 |
| |
| 摘 要： | 0-1背包问题是算法设计分析中的经典问题,本文主要通过对回溯法、动态规划、贪心算法和遗传算法的研究,分析这四种方法在求解0-1背包问题时的优缺点并进行了比较.
|
| 关 键 词： | 背包问题 回溯法 动态规划 贪心算法 遗传算法 |
Analysis of 0/1 Knapsack Problem and Its Algorithm |
| |
| YING Li. Analysis of 0/1 Knapsack Problem and Its Algorithm[J]. Computer and Modernization, 2009, 0(6) |
| |
| Authors: | YING Li |
| |
| Affiliation: | Jinhua College of Profession & Technology;Jinhua 321000;China |
| |
| Abstract: | Knapsack problem is a typical question in the design and analysis of algorithms,this article primarily introduces back tracking,dynamic programming,greedy method and genetic algorithm,and analyzes the advantages and disadvantages of these four methods for solving 0-1 knapsack problem separately and makes a conclusion. |
| |
| Keywords: | knapsack problem back tracking dynamic programming greedy method genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
