摘要
背包问题是算法分析中的一个典型的问题,已经得到了各种解决方法。但是一个问题在学术上的研究是无止境的,本文正是基于这样的一种精神,提出了最优性价比法来重新研究和解决这个问题。
Knapsack problem is a typical problem in algorithm analysis which has been a variety of solutions.However,the academic research for a problem is endless.On the basis of such a kind of spirit,this paper puts forward the optimal cost-effective method to re-examine and solve this problem.
出处
《山西电子技术》
2009年第5期93-93,96,共2页
Shanxi Electronic Technology
关键词
背包问题
最优性价比
Knapsack problem
the optimal cost-effective method
