搜索资源列表
tracking01
- 采用回溯法解决0-1背包问题,验证是否能获得最优解.-Retrospective method used to solve 0-1 knapsack problem, verify whether he can be the optimal solution.
Knapsacks
- 0/1背包,N皇后求解 0/1背包,N皇后求解
traceback1
- c# 0-1背包 穷举法,绝对正确,已经通过测试。-this is beibao。it s very good,trust me!
Backtrack
- 0-1背包Backtrack,算法中回索法的一个好例子-0-1 Knapsack Backtrack, back Sofa algorithm a good example of
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
0-1bag
- 解决0/1背包问题 : 给定一定容量的一个背包,要求放入的货物价值最大(每个货物有固定的容量和价值)-Solve the 0/1 knapsack problem: given a knapsack of a certain capacity, the requirements placed the greatest value of the goods (one for each cargo capacity and a fixed value)
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
0-1beibao
- 0-1背包问题~实现完整程序~直接解压缩即可~-0-1 knapsack problem ~ ~ Direct to achieve a complete decompression procedures can be ~
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
0-1knapsackproblem
- 动态规划解0/1背包问题knapsack problem-Dynamic programming solution 0/1 knapsack problem
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
rdthe
- 课程设计时我们的0-1背包问题,大家需要的-Curriculum design of our 0-1 knapsack problem, we need to
ddgg
- 需要的0-1背包问题的解,课程设计时的必须-Required the solution of 0-1 knapsack problem, curriculum design must be
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
- java实现0/1背包问题,算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.