您要查找的是不是：
- 0 - 1 knapsack problem 0-1背包问题
- 0- 1 knapsack problem 0-1背包问题
- Knapsack problem is a typical NP complete problem. 背包问题是一个典型的np完全问题。
- The function optimization and knapsack problem show the effectiveness of PEA. 函数优化和背包问题实验验证了PEA的有效性。
- A new approximation algorithm is presented for the classical0-1 knapsack problem in this paper. 运用属性论的转换程度函数,结合贪婪算法和核问题的研究思路提出了多维0-1背包问题的一种新型近似解法。
- An optimization algorithm for multiple-choice knapsack problem based on ant colony system is presented. 提出了一种用蚁群系统求解多选择背包问题的优化算法。
- In this paper, we try to apply Binary System Particle Swarm Optimization (BSPSO) with death Penalty function to solve 0/1 knapsack problem. 摘要将带有死亡罚函数的二进制粒子群优化算法应用于0/1背包问题。
- The 0/1 knapsack problem is a well known combinatorial problem which is NP-Complete. 摘要0/1背包问题是一类典型的组合优化问题，且属于NP完全问题。
- By introducing the transformative knapsack problem into the scheme, the security of new scheme one is strengthened. 通过引入变形的背包问题，新方案一的安全性进一步提高。
- I have written a knapsack problem of the greedy algorithm, a very good learning tool. 自己编写的一个背包问题的贪心算法，很好的学习工具。
- Knapsack problem is a famous NPC problem, there is no effective method to solve this question at present. 背包问题是一个NP完全问题,目前还没有解决这一问题的非常有效的方法。
- This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem. 提出了0-1多项式背包问题的一种新的精确算法。
- The NP-Completeness of them is proven by reduction from the well known KNAPSACK problem. 用整数背包问题具体证明了这两个问题的NP-完备性。
- Transform the model into a classic unbounded knapsack problem and present a dynamic programming algorithm to solve it. 对此模型用动态规划的方法进行求解,得到了测试用例的最优分配方案;
- Discusses the classical knapsack problem applies the genetic algorithm to solve the problem. 对决策优化的经典背包问题进行了研究，提出了应用遗传算法对该模型进行求解。
- The experiment results of the knapsack problem and multiuser detection problem show that the both of the propos... 通过对0-1背包问题和多用户检测问题的求解表明,新的算法不仅操作更简单,而且全局搜索能力有了显著的提高。
- A particle swarm algorithm is presented to solve the multi-constraint Knapsack problem. 为采用改进粒子群算法求解多约束背包问题。
- Algorithms in the program excogitate technology are recounted,a new algorithm of solving knapsack problem is expounded,it uses algorithms amalgamate. 介绍了程序设计技术中的几种算法 ,并利用算法间的混合提出了一种解决背包问题的新型算法
- The validity of this method is tested via the simulation expenriment by applying this method to the genetic algorithm for solving the multiple choice knapsack problem. 将该方法应用到多重选择背包问题的遗传算法中，通过仿真实验验证了该方法的有效性。
- From the viewpoint of intensifying convergence and reducing dependency of parameters, a renewed simulated annealing algorithm for solving knapsack problem is proposed. 摘要从增强算法收敛性和减少参数依赖性的角度出发，提出应用改进的模拟退火算法求解0-1背包问题。
