Therefore, the hybrid intelligence algorithm is effective to solve 0-1 knapsack problems.
因此，应用该混合智能算法求解0 - 1背包问题是比较有效的。
The method based on knowledge evolution algorithm is proposed to solve knapsack problems.
知识进化算法是在分析知识进化机制基础上提出的一种新型优化算法。
In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
The numerical experimental results show that NSGA-II with the neighborhood search can outperform NSGA-II applied to multi-objective 0-1 knapsack problems.
数值实验表明，引入邻域搜索机制的NSGA - II算法在求解多目标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.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
Aiming at combinatorial optimization problems, this paper carries out the following main research work based on EDA. A hybrid EDA is proposed to solve the multidimensional knapsack problems (MKP).
本文针对组合优化问题，基于分布估计算法主要开展了如下研究：针对多维背包问题，设计了一种混合分布估计算法。
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完全问题的并行三表六子表算法。
应用推荐