摘要
本文给出了一个以动态状态空间树为基础的０／１背包问题的回溯算法．动态树方法对求解线性规划问题等是非常有用的，该算法所用时间比静态状态空间树方法要少．文中给出的Ｓｐａｒｋｓ算法经用Ｃ语言写成程序上机验证。
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.
出处
《天津理工学院学报》
1996年第4期17-22,共6页
Journal of Tianjin Institute of Technology
