Being different from the traditional Knapsack algorithm, KFA is for multiple-objective optimization.
与传统的背包算法不同的是，该算法适合于多维目标优化。
This is about 01 knapsack problem dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
Therefore, the hybrid intelligence algorithm is effective to solve 0-1 knapsack problems.
因此，应用该混合智能算法求解0 - 1背包问题是比较有效的。
In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有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.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem.
提出了0-1多项式背包问题的一种新的精确算法。
Based on the ant colony optimization idea, this paper presents a new algorithm for the classical knapsack problem.
针对经典的背包问题，给出一种新的基于蚂蚁优化思想的求解算法。
In this paper, we propose a new digital watermarking algorithm based on quadratic knapsack problem, which belongs to public-key cryptosystem.
本文通过研究公钥密码学中的二次背包体制，给出了一种基于二次背包加密的数字水印算法。
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 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 method based on knowledge evolution algorithm is proposed to solve knapsack problems.
知识进化算法是在分析知识进化机制基础上提出的一种新型优化算法。
In this paper, a modified particle swarm optimization algorithm is presented to solve knapsack problem, and the detailed realization of the algorithm is illustrated.
本文提出了改进的粒子群算法求解背包问题，阐明了该算法求解背包问题的具体实现过程。
Using ant colony algorithm to solve 0-1 knapsack problem.
用蚁群算法解决0-1背包问题。
This algorithm is verified by solving knapsack problem, the results of the experiment show that the proposed algorithm can result in better profits.
通过求解背包问题对算法进行验证，实验结果表明所提算法性能较优。
Trial designed recursive algorithm for solving 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.
本文应用带记忆功能的模拟退火演算法，结合理论分析和经验法则，通过大量试验确定了一组有效的冷却进度表参数，成功地解决了这个复杂而特殊的背包问题。
A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.
提出了一种蚁群系统与多选择背包问题融合的算法。
A general-purpose parallel three-list six-table algorithm that can solve a number of knapsack-like NP-complete problems is developed in this paper.
将串行动态二表算法应用于并行三表算法的设计中，提出一种求解背包、精确的可满足性和集覆盖等背包类NP完全问题的并行三表六子表算法。
A general-purpose parallel three-list six-table algorithm that can solve a number of knapsack-like NP-complete problems is developed in this paper.
将串行动态二表算法应用于并行三表算法的设计中，提出一种求解背包、精确的可满足性和集覆盖等背包类NP完全问题的并行三表六子表算法。
应用推荐