0/1背包问题 1. Competitive decision algorithm for0/1-knapsack problem; 0/1背包问题竞争决策算法 2. Based on mathematical inference, this paper proposes a quick reduction algorithm for0/1-knapsack problem. 用数学方法分析了0/1背包问题的特性,提出了一个快速降价算法,该算法能成批确定一定在最优解中...
On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem; 有序组合树法求解0-1背包问题初探 2. Solving the 0-1 s knapsack Problem by Genetic Algorithm; 用基本遗传算法解决0-1背包问题 3. New genetic algorithm to solve 0-1 knapsack problem 一种求解0-1背包问题的新遗传算法 4....
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背包问题的特性,提出了一个快速降价算法,该算法能成批确定一定在最优解中的物品和...
Genetic algorithm with schema replaced for solving 0/1 knapsack problem 一种基于模式替代的遗传算法解0/1背包问题8. In this paper, we try to apply Binary System Particle Swarm Optimization (BSPSO) with death Penalty function to solve 0/1 knapsack problem. 将带有死亡罚函数的二进制粒子群优化算...
0-1多维背包问题 1. Based on global evaluation model for Grid workflow,services selection was modeled as a 0-1 multi-dimensional knapsack problem by transforming the service requester s requirements into constraints. 针对现有W eb服务组合方法对服务质量(QoS)贪婪索取而不利于网格资源有效利用的问题,提出...
0-1多维背包问题 1. Based on global evaluation model for Grid workflow,services selection was modeled as a 0-1 multi-dimensional knapsack problem by transforming the service requester s requirements into constraints. 针对现有W eb服务组合方法对服务质量(QoS)贪婪索取而不利于网格资源有效利用的问题,提出...
0-1多维背包问题 1. Based on global evaluation model for Grid workflow,services selection was modeled as a 0-1 multi-dimensional knapsack problem by transforming the service requester s requirements into constraints. 针对现有W eb服务组合方法对服务质量(QoS)贪婪索取而不利于网格资源有效利用的问题,提出...
0-1多维背包问题 1. Based on global evaluation model for Grid workflow,services selection was modeled as a 0-1 multi-dimensional knapsack problem by transforming the service requester s requirements into constraints. 针对现有W eb服务组合方法对服务质量(QoS)贪婪索取而不利于网格资源有效利用的问题,提出...
0/1多选择背包问题2) multiple-choice knapsack problem 多选择背包问题 1. Then, advanced a modified differential evolution algorithm (MDEA) for multiple-choice knapsack problem (MCKP) over discrete space, which use individual positive coding method and combine with the subtle adjusting strategy of ...
Hybrid Genetic Algorithm for Multiconstraint 0-1 Knapsack Problem 求解多限制0-1背包问题的混合遗传算法 5. On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem; 有序组合树法求解0-1背包问题初探 6. Solving the 0-1 s knapsack Problem by Genetic Algorithm; 用基本遗传算法解决0...