So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
让我们开始仔细讲讲一个问题，那就是背包问题。
Let's now go back and instantiate these ideas for the knapsack problem we looked at last time in particular, for the 0-1 knapsack problem.
让我们回来用具体例子，来说明我们上次看过的背包问题，特别是对0 - 1背包问题来说。
And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators.
并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。
With the continuous knapsack problem as we've formulated it, greedy is good.
因为正如我们已经归越过的，对于一般连续性背包问题贪婪算法很实用。
But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.
但是让我们找一找它的一些变种，在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
Based on the ant colony optimization idea, this paper presents a new algorithm for the classical knapsack problem.
针对经典的背包问题，给出一种新的基于蚂蚁优化思想的求解算法。
This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem.
提出了0-1多项式背包问题的一种新的精确算法。
The precise and approximate algorithms solving 0-1 knapsack problem, precise algorithm could not be used to solve 0-1 knapsack problem in a short time, so it could not be applied extensively.
求解0 - 1背包问题的精确算法不能在较短时间内求解大规模0 - 1背包问题，使其实用性受到限制。
The idea of rank two relaxation for max-cut problem is used to quadratic knapsack problem, and the model of the rank two relaxation for quadratic knapsack problem is obtained.
把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
Under the assumption that the random high-density knapsack problem is infeasible, the proposed schemes are provably secure against ciphertext-only attack.
在高密度随机背包困难性假设下，可以证明方案在唯密文攻击下是安全的。
The relations among the board welding problem, knapsack problem and cutting stock problem are also discussed.
另外还讨论了拼板问题、背包问题和下料问题的关系。
In this paper, a modified particle swarm optimization algorithm is presented to solve knapsack problem, and the detailed realization of the algorithm is illustrated.
本文提出了改进的粒子群算法求解背包问题，阐明了该算法求解背包问题的具体实现过程。
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；
The basic principle and step of these three algorithms are given to solve Multiple-choice Knapsack Problem.
给出了用这三种算法解决多选择背包问题的基本原理及求解步骤。
By making use of simulated annealing algorithm with memory, and determining a set of effective cooling schedule, the thesis solves this complex and special knapsack problem successfully.
本文应用带记忆功能的模拟退火演算法，结合理论分析和经验法则，通过大量试验确定了一组有效的冷却进度表参数，成功地解决了这个复杂而特殊的背包问题。
In theory, the layout problem of storage space can be interpreted as a knapsack problem.
从理论上讲，仓储空间布局问题可以理解为背包问题。
This algorithm is verified by solving knapsack problem, the results of the experiment show that the proposed algorithm can result in better profits.
通过求解背包问题对算法进行验证，实验结果表明所提算法性能较优。
The simulation result indicates that the performance of BSPSO on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms.
针对0-1 背包问题，提出一种具有修复策略的、贪心算法与二进制粒子群算法相结合的混合智能算法。
The simulation result indicates that the performance of BSPSO on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms.
针对0-1 背包问题，提出一种具有修复策略的、贪心算法与二进制粒子群算法相结合的混合智能算法。
应用推荐