| 有序组合树法求解0-1背包问题初探 |
| |
| 引用本文： | 安晨,付永军.有序组合树法求解0-1背包问题初探[J].温州大学学报(社会科学版),2008(1):10-14. |
| |
| 作者姓名： | 安晨 付永军 |
| |
| 作者单位： | 兰州交通大学交通运输学院,甘肃兰州730070 |
| |
| 摘 要： | 以0-1背包问题为研究对象，建立教学模型，采用有序组合树法对中小规模的背包问题进行求解。与传统的贪婪算法相比，该算法更容易找到最优解，并通过实例说明该算法对解决中小规模的0-1背包问题是行之有效的。
|
| 关 键 词： | 背包问题 有序组合树 算法 |
On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem |
| |
| AN Chen,FU Yongjun.On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem[J].Journal of Wenzhou University Natural Science,2008(1):10-14. |
| |
| Authors: | AN Chen FU Yongjun |
| |
| Institution: | (School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, China 730070) |
| |
| Abstract: | With 0-1 knapsack problem being research object, this paper has set up a mathematical model for 0-1 knapsack problem. Planning to solve 0-1 knapsack problem for medium-sized and small scale by the sequential combination tree algorithm, through analysis and computation for the concrete example, it is proved that the sequential combination tree algorithm is feasible and effective for solving 0-1 knapsack problem for medium and small scale, compared to traditional greedy algorithm, the optimal solution is very easy to be found. |
| |
| Keywords: | Knapsack problem Sequential combination tree Algorithm |
| 本文献已被 维普 等数据库收录！ |
|
