Using ant colony algorithm to solve 0-1 knapsack problem.
用蚁群算法解决0-1背包问题。
This is about 01 knapsack problem dynamic programming algorithm.
这是关于01背包问题的动态规划算法。
Particle Swarm Optimism; Knapsack Problem; genetic probability;
粒子群优化算法；背包问题；遗传概率；
Trial designed recursive algorithm for solving knapsack problem.
试用递归方法设计求解背包问题的算法。
With the continuous knapsack problem as we've formulated it, greedy is good.
因为正如我们已经归越过的，对于一般连续性背包问题贪婪算法很实用。
The solution process is described with the solution of 0/1 knapsack problem.
结合0 / 1背包问题的求解，阐明这种方法求解问题的过程。
The function optimization and knapsack problem show the effectiveness of PEA.
函数优化和背包问题实验验证了PEA的有效性。
So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
让我们开始仔细讲讲一个问题，那就是背包问题。
In theory, the layout problem of storage space can be interpreted as a knapsack problem.
从理论上讲，仓储空间布局问题可以理解为背包问题。
This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem.
提出了0-1多项式背包问题的一种新的精确算法。
The experimental results show that it is a fast and efficient method for knapsack problem.
实验结果表明，采用此算法能快速有效地解决背包问题。
A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.
提出了一种蚁群系统与多选择背包问题融合的算法。
The basic principle and step of these three algorithms are given to solve Multiple-choice Knapsack Problem.
给出了用这三种算法解决多选择背包问题的基本原理及求解步骤。
The relations among the board welding problem, knapsack problem and cutting stock problem are also discussed.
另外还讨论了拼板问题、背包问题和下料问题的关系。
Based on the ant colony optimization idea, this paper presents a new algorithm for the classical knapsack problem.
针对经典的背包问题，给出一种新的基于蚂蚁优化思想的求解算法。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
This article proposes a new easy knapsack problem, based on which a novel knapsack-type public key cryptosystem is derived.
该文提出了一类新的易解背包问题，基于此问题构造了一个新的加法背包型公钥密码体制。
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背包问题。
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背包问题来说。
In this paper, we propose a new digital watermarking algorithm based on quadratic knapsack problem, which belongs to public-key cryptosystem.
本文通过研究公钥密码学中的二次背包体制，给出了一种基于二次背包加密的数字水印算法。
This algorithm is verified by solving knapsack problem, the results of the experiment show that the proposed algorithm can result in better profits.
通过求解背包问题对算法进行验证，实验结果表明所提算法性能较优。
So I haven't done magic, I've given you a really fast way to solve a knapsack problem, but it's still exponential deep down in its heart, in something.
所以我并没有施魔法，我已经告诉了你，一种快速解决背包问题的方法了，但是某些方面它的核心仍然是指数增长的。
Under the assumption that the random high-density knapsack problem is infeasible, the proposed schemes are provably secure against ciphertext-only attack.
在高密度随机背包困难性假设下，可以证明方案在唯密文攻击下是安全的。
For knapsack problem (which is a classical recursion problem), find its round solution which need not stack to support, then prove it exists parallel solutio.
对于背包问题这样一个经典的递归问题，发现了它的不需栈支持的循环解法，并由此说明其存在并行。
For knapsack problem (which is a classical recursion problem), find its round solution which need not stack to support, then prove it exists parallel solution.
对于背包问题这样一个经典的递归问题，发现了它的不需栈支持的循环解法，并由此说明其存在并行解。
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 背包问题，提出一种具有修复策略的、贪心算法与二进制粒子群算法相结合的混合智能算法。
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 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.
把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。
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.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
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背包问题，从而可用动态规划寻求最佳的出清向量；
应用推荐