搜索资源列表
vb_Calculator
- 基于遗传算法的背包问题求解,有基本的说明和代码-based on genetic algorithm knapsack problem solving, a basic descr iption and code.
simulate_knapsack
- 下面是模拟退火算法的代码,使用模拟退火算法(SAA)解决0-1背包问题 -Below are simulated annealing algorithm code, the use of simulated annealing algorithm (SAA) 0-1 knapsack problem solving
dongtaiguihua
- 动态规划算法的一个实例,解决0-1背包问题-dynamic programming algorithm an example to solve 0-1 knapsack problem
01package
- 背包问题优先队列分枝限界算法 所谓的背包问题,可以描述如下:一个小偷打劫一个保险箱,发现柜子里有N类不同大小与价值的物品,但小偷只有一个容积为M的背包来装东西,背包问题就是要找出一个小偷选择所偷物品的组合,以使偷走的物品总价值最大。这个问题的求解有很多种方法,本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack
GA_for_TSP
- 用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里,每件物品的重量为W1,W·2……Wn,与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意:在本题中,所有的重量值均为整数。-genetic algorithm knapsack problem is the N
beibaotanxinsuanfa
- 贪心算法,使用这一算法,解决0-1背包问题.-greedy algorithm, the algorithm used to solve 0-1 knapsack problem.
0-1package
- 遗传算法求解0-1背包问题,包含问题的求解步骤。-Genetic Algorithm 0-1 knapsack problem, including steps to solve the problem.
Fractionalbag
- 关于分数背包的解决 欢迎批评指教-scores knapsack on the settlement welcome comments and suggestions
TSPTravelingsalesmanproblem
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序拟退火算法解0-1背包问题MATLAB源代码 -complete graph Hamilton Circle genetic simulated annealing Matlab to be definitive source solution annealing 0- a knapsack problem MATLAB source code
017387-01
- 论坛代码 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪-Forum with the branch code boundaries to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem
Chp15
- 背包问题的遗传算法解法 背包问题的遗传算法解法-knapsack problem genetic algorithm method knap sack problem GA knapsack asked Solution that the genetic algorithm method knapsack problem Genetic Algorithm Solution
beibao
- 0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大? 在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。因此,该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solutio
beibaowenti
- 这是一个用回溯算法解0--1背包问题的C++程序(好用的)-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)
yiqun_ziliao
- 蚁群算法源代码(附带蚁群算法在0-1背包问题和TSP问题中的应用资料两篇)-Ant colony algorithm source code (with ant colony algorithm in the 0-1 knapsack problem and the TSP data Problem 2)
bag
- 背包问题的解决,使用microsoft visual c++编写,算法简单-Knapsack problem, the use of microsoft visual c++ Prepared algorithm is simple
guihua
- 算法设计分析,动态规划,与背包问题类似的最优化求解问题-Algorithm design and analysis, dynamic programming, knapsack problem with a similar optimization problem solving
beibaowenti
- 背包问题的非递归解法,利用二进制来实现穷举。-Knapsack problem of non-recursive method, using the binary to achieve exhaustive.
Proj1
- 这是经典的背包问题,其中包含多种算法,以及背包问题的拓展-This is the classic knapsack problem, which includes a variety of algorithms, as well as the expansion of knapsack problem
beibao
- 该可实现简单的背包功能,可用最佳贪心算法和最佳路径算法,可获得。-The backpack can be a simple function, the best available greedy algorithm and best path algorithm can be obtained.
dongtaiguihua_01beibao
- vb环境下用动态规划方法编的0/1背包问题-vb environment made using dynamic programming method of 0/1 knapsack problem