| 基于0-1背包问题的两种算法 |
| |
| 引用本文： | 李强,蓝雯飞.基于0-1背包问题的两种算法[J].软件,2014(3):105-106. |
| |
| 作者姓名： | 李强 蓝雯飞 |
| |
| 作者单位： | 中南民族大学计算机科学学院,武汉430074 |
| |
| 摘 要： | 0-1背包问题是计算机科学中一个经典问题，0-1背包问题是一个最优化问题。因其结构简单，可扩展性强，可作为其他问题的子问题，因此通过对其研究可以解决更为复杂的优化问题。本文概述了两种求解0-1背包问题的算法设计方法，并对两种算法进行了分析和比较。
|
| 关 键 词： | 0-1背包问题 回溯 动态规划 |
Two Algorithms Based on 0-1 Knapsack Problem |
| |
| LI Qiang,LAN Wen-fei.Two Algorithms Based on 0-1 Knapsack Problem[J].Software,2014(3):105-106. |
| |
| Authors: | LI Qiang LAN Wen-fei |
| |
| Affiliation: | (South-Central Universityfor Nationalities, Wuhan 430074,China) |
| |
| Abstract: | The 0-1 knapsack problem is a classical problem in Computer Science, 0-1 knapsack problem is an optimization problem. Because of its simple structure, strong scalability, it can be used as sub problems of other problems. Therefore the research can solve more complex optimization problems. This paper summarizes the two kinds of algorithms to solve 0-1 knapsack problem,finally two algorithms are compared and analyzed. |
| |
| Keywords: | 0-1 knapsack problem backtrack dynamic programming |
| 本文献已被 维普 等数据库收录！ |
|
