... 背包问题算法实现 Knapsack Problem Algorithm 背包问题求解 Knapsack Problem Solving 分数背包问题 fractional knapsack problem ...
基于8个网页-相关网页
因此，应用该混合智能算法求解0 - 1背包问题是比较有效的。
Therefore, the hybrid intelligence algorithm is effective to solve 0-1 knapsack problems.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
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.
本文提出了改进的粒子群算法求解背包问题，阐明了该算法求解背包问题的具体实现过程。
In this paper, a modified particle swarm optimization algorithm is presented to solve knapsack problem, and the detailed realization of the algorithm is illustrated.
应用推荐