搜索资源列表
xujinpeng-matlab.rar
- 遗传算法编程求解旅行商问题;图论中最短路问题的Matlab程序实现;背包问题模型的Matlab程序实现。,Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.
GQA.rar
- 遗传量子算法求解背包问题Matlab源码,Quantum Genetic Algorithm for Knapsack Problem
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
Knapsack
- 背包问题,一个不错的动态规划算法显示,值得一看-Knapsack problem, a good dynamic programming algorithm indicates that worth a visit
0-1Knapsack.problem
- Knapsack problemnew01背包问题(动态规划) 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
knapsack
- 九讲背包问题。一本很好的算法书,详细讲解了背包问题。-Nine speakers knapsack problem. A good algorithm book, explain in detail the knapsack problem.
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档,包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
beibaobeibao
- 这是一个0/1背包问题的解决,有图形界面,是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
knapsack
- 程序设计思路 在动态规划中,可将一个问题的解决方案视为一系列决策的结果,要考察每个最优决策序列中是否包含一个最优子序列。所以在最短路径问题中,假如在的第一次决策时到达了某个节点v,那么不管v 是怎样确定的,此后选择从v 到d 的路径时,都必须采用最优策略。利用最优序列由最优子序列构成的结论,可得到f 的递归式。f ( 1 ,c) 是初始时背包问题的最优解。可使用(1)中所示公式通过递归或迭代来求解f ( 1 ,c)。从f (n, * )开始迭式, f (n, * )由第一个式子得出,然后由
zero_one_question
- 算法中的经典问题:0——1 背包问题 在该程序中运用了动态规划算法成功解决了0——1背包问题-Classic problem of algorithm 0- 1 knapsack problem in the process use of dynamic programming algorithms succeeded in solving 0- 1 Knapsack Problem
LinerArange
- 动态规划方法视线特殊的(0,1,2)背包问题,获得最佳的物品取舍方案-Dynamic programming special attention (0,1,2) knapsack problem, obtain the best trade-off program items
Knapsack
- 0-1背包问题, 0-1背包问题 Version 1.0 2008-10-28-0-1 knapsack problem, 0-1 knapsack problem Version 1.02008-10-28
Fac3_9
- //0-1背包问题动态规划解法,原自王晓东算法设计,该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
package
- 动态规划的背包问题,包括讲解,源代码还有详细的例证。-Dynamic programming knapsack problem, including explanations, there is a detailed source code examples.
GA
- 本程序是在MATLAB平台上,利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中,需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
backtrack1
- This function implements brute force bactracking to solve the knapsack problem.
Knapsack_Problems
- 背包类问题浅析和一些背包类问题的解答源程序。-Knapsack-type problem and some of the answers to questions backpack source category.
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.
Knapsack
- 背包问题,背包问题的5种算法,一共五个文件,每个文件一种算法-Knapsack problem, knapsack problem of the five kinds of algorithms, a total of five files, each file an algorithm
1
- Matlab code for knapsack