1) 0-1 Knapsack
0-1背包
1.
The Dynamic Programming Algorithms of 0-1 Knapsack Problem Based on Visual C++;
基于Visual C++的0-1背包问题的动态规划算法
2.
Two Kinds of Expanding Forms of 0-1 Knapsack Problem and Its Solution Methods;
0-1背包问题的两种扩展形式及其解法
2) 0/1 knapsack
0/1背包
1.
Research of Dynamic Design Algorithm for 0/1 Knapsack Problem;
0/1背包问题动态规划算法的探讨
2.
Discussion on 0/1 knapsack problem application;
0/1背包问题应用探讨
3.
0/1 knapsack problem is a classical problem in algorithm field.
0/1背包问题是计算机算法中一个经典问题。
3) 0-1 knapsack problem
0-1背包问题
1.
New hybrib algorithm for solving 0-1 knapsack problem;
一种新的求解0-1背包问题的混合算法
2.
A Kind of Renewed Simulated Annealing Algorithm Solves 0-1 Knapsack Problem;
一种改进的模拟退火算法求解0-1背包问题
3.
Solving 0-1 knapsack problem based on ant colony optimization algorithm;
基于蚁群优化算法的0-1背包问题求解
4) 0/1 knapsack problem
0/1背包问题
1.
Hybrid genetic algorithm with high convergent speed for solving 0/1 knapsack problem;
求解0/1背包问题的快速收敛的混合遗传算法
2.
Solve 0/1 Knapsack Problem by a Hybrid Genetic Algorithm Based on Greed Algorithm;
用基于贪婪算法的混合遗传算法求解0/1背包问题
3.
Solution to the 0/1 knapsack problem based on particle swarm optimization of death penalty function;
用带有死亡罚函数的粒子群优化算法求解0/1背包问题
5) 0/1-knapsack problem
0/1背包问题
1.
Competitive decision algorithm for 0/1-knapsack problem;
0/1背包问题竞争决策算法
2.
Based on mathematical inference, this paper proposes a quick reduction algorithm for 0/1-knapsack problem.
用数学方法分析了0/1背包问题的特性,提出了一个快速降价算法,该算法能成批确定一定在最优解中的物品和成批排除一定不在最优解中的物品。
6) multi-objective 0/1 knapsack problems
多目标0/1背包问题
1.
A new algorithm for multi-objective 0/1 knapsack problems is proposed.
提出一种用于求解多目标0/1背包问题的新算法。
补充资料：背包
行军或外出时背（bēi）在背上的衣被包裹。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条