| 0-1背包问题之穷举、搜索、动态规划算法探讨 |
| |
| 引用本文： | 曹周进.0-1背包问题之穷举、搜索、动态规划算法探讨[J].数字社区&智能家居,2009(12). |
| |
| 作者姓名： | 曹周进 |
| |
| 作者单位： | 汤溪中学; |
| |
| 摘 要： | 该文论述了算法学习中非常经典的0-1背包问题,探讨用穷举、搜索、动态规划三种算法来解决0-1背包问题,并讨论算法在时间和空间复杂度上的优化,给出具体的参考程序。
|
| 关 键 词： | 0-1背包 算法设计 算法优化 参考程序 |
The Study on Exhaust Slgorithm,Search Algorithm,Dynamic Design for 0-1 Knapsack Problem |
| |
| CAO Zhou-jin.The Study on Exhaust Slgorithm,Search Algorithm,Dynamic Design for 0-1 Knapsack Problem[J].Digital Community & Smart Home,2009(12). |
| |
| Authors: | CAO Zhou-jin |
| |
| Affiliation: | Tangxi Middle School;Jinhua 321075;China |
| |
| Abstract: | This article elaborated the extremely classical 0-1 knapsack question in the algorithm study. In this paper, the exhaust algorithm, the search algorithm, the dynamic design are proposed to solve the 0-1 knapsack problem. It also carries on the optimization to the time and space complexity of algorithm, giving us the concrete reference program. |
| |
| Keywords: | 0-1 knapsack problem algorithm design algorithm optimization reference program |
| 本文献已被 CNKI 等数据库收录！ |
|
