| 0／1背包问题的动态状态树的回溯算法 |
| |
| 引用本文： | 张治洪,刘玉贵.0／1背包问题的动态状态树的回溯算法[J].天津理工大学学报,1996(4). |
| |
| 作者姓名： | 张治洪 刘玉贵 |
| |
| 作者单位： | 天津理工学院光电信息系(张治洪)，北京市玻璃研究所(刘玉贵) |
| |
| 摘 要： | 本文给出了一个以动态状态空间树为基础的０／１背包问题的回溯算法．动态树方法对求解线性规划问题等是非常有用的，该算法所用时间比静态状态空间树方法要少．文中给出的Ｓｐａｒｋｓ算法经用Ｃ语言写成程序上机验证，思路正确
|
| 关 键 词： | 0／1背包问题 回溯算法 动态状态空间树 |
THE BACKTRACKING ALGORITHM OF DYNAMIC STATE SPACE TREE OF 0/1 KNAPSACK PROBLEM |
| |
| Zhang,Zhihong,Liu,Yugui.THE BACKTRACKING ALGORITHM OF DYNAMIC STATE SPACE TREE OF 0/1 KNAPSACK PROBLEM[J].Journal of Tianjin University of Technology,1996(4). |
| |
| Authors: | Zhang Zhihong Liu Yugui |
| |
| Institution: | Zhang Zhihong Liu Yugui |
| |
| Abstract: | This paper introduces a backtracking algorithm for 0/1 knapsack problem based on dynamic state space tree which is useful for resoving linear programing.In contrast to static space tree algorithm, the new algorithm spends less times.The sparks algorithm discussed in this paper has been demonstrated using C language in computer. |
| |
| Keywords: | O/1 knapsack problem backtracking algorithm dynamic state space tree |
| 本文献已被 CNKI 等数据库收录！ |
