搜索资源列表
an
- 利用模拟退火解决0-1背包问题,适合初学者。-The use of simulated annealing to solve 0-1 knapsack problem, suitable for beginners.
Fac3_9
- //0-1背包问题动态规划解法,原自王晓东算法设计,该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
GA
- 本程序是在MATLAB平台上,利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
0-1
- 在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高。-At 0/1 knapsack problem, there is a need for a capacity of c to load the backpack. N items from a selected items into the backpack, each i
KnapsackProblem
- 0/1背包问题的几种解法,包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
0-1
- 分支限界法 0/1背包问题 程序 分支限界法 0/1背包问题 程序
POS_c
- 本程序是用PSO用于求解NP难问题,如0-1背包问题,效果很好-This procedure is used PSO for solving the NP hard problems, such as 0-1 knapsack problem, well
knapsack
- 0-1背包问题,典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
SA
- 这是用模拟退火算法解决0-1背包问题,下载后可直接运行,可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing algorithm to find out about fr
pso_01
- 使用二进制PSO解决0-1背包问题的MATLAB程序-The use of PSO to solve 0-1 knapsack problem
0-1
- 0-1背包问题的动态规划,根据算法书上自己编写的一个小程序,背包问题用动态规划的方法来解决-0-1 knapsack problem dynamic programming, according to algorithm I have written the book on a small program, knapsack problem using dynamic programming approach to the
simulateanneal
- 一个解决0-1背包问题的模拟退火程序,希望给有需要的人帮助-A solution to the 0-1 knapsack problem simulated annealing process, hoping to help those in need
0-1
- 0-1背包问题, 给定一个载重量为m,n个物品,其重量为wi,价值为vi,1<=i<=n,要求:把物品装入背包,并使包内物品价值最大-0-1 knapsack problem, given a load for the m, n one item, the weight wi, the value of vi, 1 < = i < = n, asked: the items into backpacks, and to bag the maximum value of the
39975737MATLAB_gatool
- 解决0-1背包问题的遗传算法matlab程序,欢迎交流提高。-Solve the 0-1 knapsack problem genetic algorithm matlab program, welcomed the exchange increased.
packegePSO1
- 用matlab编写的一个解决0-1背包问题,其算法采用粒子群算法-use matlab software write 0-1 knapsack problem use PSO method
0-1-knapsack-problem-solution
- 这是一个关于0-1背包问题算法的编程实现,包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
0-1
- 0-1 背包问题-动态规划法,算法设计课程作业-0-1 knapsack problem- dynamic programming, algorithm design course work
0-1-bag-problem
- 一种算法来解决0-1背包问题,这是非常好的-one arithmetic to solve 0-1 bag problem
0-1
- 0-1背包问题算法书籍代码,同大家分享!-0-1 Knapsack Problem Books in code share with you!
0-1-knapsack-problem-matlab
- 关于matlab解决0-1背包问题的修改,原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code