搜索资源列表
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.
tracking01
- 采用回溯法解决0-1背包问题,验证是否能获得最优解.-Retrospective method used to solve 0-1 knapsack problem, verify whether he can be the optimal solution.
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
tanxinsuanfa
- 背包问题和0/1背包问题的主要区别就是物品可不可以再分割。背包问题中的物品可以再进行分割，而0/1背包问题中的物品则反之。贪心算法往往只从局部去考虑问题，所以在解决0/1背包问题时得不到最优解。-class GreedyAlgorithm{ public: GreedyAlgorithm(int _weight[],int _value[],int capacity) double*ComputeRatio() void Sor
dongtaiguihua
- 动态规划解决0-1背包问题，可以完整输出结果-Dynamic programming to solve 0-1 knapsack problem, you can complete the output
knapsack
- c语言实现的0-1背包问题，很简单，运行正常可靠，页面简洁。-c language implementation of the 0-1 knapsack problem, is very simple, operating normally reliable, simple page.
txss
- 0-1背包问题，非常重要的，必须好好学啊！同学忙呢 -0-1 knapsack problem, a very important and should be properly learn ah! Busy students do
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
- 这个文件夹包含了0-1背包问题的源代码、可执行文件和上级报告。-This folder contains the 0-1 knapsack problem source code, executable files, and supervisor.
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.