搜索资源列表
simulatedannealingalgorithm
- 关于模拟退火算法的书籍,以及在0-1背包问题、旅行商问题上的实现-a book about simulated annealing algorithm
Based
- 基于遗传算法的0-1背包问题的求解，可进一步另深对遗传算法理解，学习算法分析与设计的可以-Based on Genetic Algorithm for Solving 0-1 Knapsack Problem
1108
- 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高，即n ?i=1pi xi 取得最大值。约束条件为n ?i =1wi xi≤c 和xi?[ 0 , 1 ] [ 1≤i≤n]。-At 0/1 knapsack problem, there is a need for a capacity of c for the loaded
d
- 1． 0-1背包问题 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高 -1. 0-1 knapsack problem at 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. N items from
i-ant
- 采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be sol
beibao
- 对几种背包问的分析与解释，主要包干，0/1背包问题，完全背包问题-failed to translate
Dynamic01
- 使用C++编写的动态规划--0-1背包问题。-The use of C++, prepared by dynamic programming- 0-1 knapsack problem.
ACO_0_1_bag
- 蚁群算法解0-1背包问题 内附测试文件 解的质量一般叫好，但是背包数增加时，耗时较长-Ant Colony Algorithm for 0-1 Knapsack Problem solution document containing test the quality of the general good, but the increase in the number of backpack, the longer time-consuming
backpack
- 0/1背包问题（附注释）：不可拆分的0/1背包问题-0/1 knapsack problem (with Notes): non-split 0/1 knapsack problem
beibao
- 采用遗传算法解决0-1背包问题，即装入物体容量有限，每个物体有不同价值，使得最终价值最高-Using genetic algorithm to solve the 0-1 knapsack problem, that is, limited capacity into objects, each object has a different value, making the final value of the maximum
KnapsackProblem
- 用动态规划的方法求解0/1背包问题，vc编写。-Using dynamic programming method for solving 0/1 knapsack problem, vc preparation.
beibaowenti
- 动态规划求0/1背包问题sdfgsdfs-Dynamic programming seek 0/1 knapsack problem sdfgsdfs
ACO
- 蚁群算法解决0-1背包问题,是一个比较小的程序，运行过，没有问题的。-the solving method of zero to one backage with ACO.It is a small programe for the zero to one problem.
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
bag_program
- 0-1背包问题，算法设计中最常见也是最经典的问题，希望对学习算法的有所帮助-0-1 knapsack problem, algorithm design of the most common and most classic problems in the hope of learning algorithms help
backpack-ga-algorithm
- 背包问题或0-1背包问题遗传算法程序，里面用的实数编码方式值得借鉴。-0-1 knapsack problem or knapsack problem genetic algorithm procedure, which uses real coding can be learned.
GA
- 遗传算法 0-1背包问题的代码 初始群体 选择 交叉 变异 评估函-0-1 knapsack problem genetic algorithm code for the initial assessment of functional group selection crossover and mutation
lingyibeibao
- 0/1背包问题的动态规划算法，要求输出背包内物品的最大价值以及选入背包的物品种类，利用动态规划方法设计背包问题-0/1 knapsack problem of dynamic programming algorithm, the maximum output value in the backpack items and selected by the backpack, dynamic programming method to design a knapsack problem
DP
- 算法设计的经典问题，动态规划算法，实现0-1背包问题-Classic problem of algorithm design, dynamic programming algorithm to achieve the 0-1 knapsack problem
knapsack
- 对于0—1背包问题问题利用动态规划法在C++中进行编程解决。-Knapsacks