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)贪婪索取而不利于网格资源有效利用的问题,提出...
1. Particle Swarm Optimization about 0/1 Knapsack Problem 关于0/1背包问题的粒子群优化算法 2. Discrete Differential Evolution Algorithm for Solving 0/1 Knapsack Problem 求解0/1背包问题的离散差分进化算法 3. Immune algorithm with antibody-repaired and its application for high-dimensional 0/1 knapsa...
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 optimizatio...
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背包问题的特性,提出了一个快速降价算法,该算法能成批确定一定在最优...
0-1多项式背包问题 1. This paper proposes a rigorous algorithm for solving the0-1 polynomial knapsack problem. 提出了0-1多项式背包问题的一种新的精确算法。 2) multi-objective 0/1 knapsack problems 多目标0/1背包问题 1. A new algorithm formulti-objective 0/1 knapsack problemsis proposed. ...
阐明了用该算法求解0-1背包问题的具体实现过程。 13. Therefore, the hybrid intelligence algorithm is effective to solve 0-1 knapsack problems. 因此,应用该混合智能算法求解0-1背包问题是比较有效的。 14. Particle Swarm Optimization about 0/1 Knapsack Problem ...