搜索资源列表
0-1Knapsack.problem
- Knapsack problemnew01背包问题(动态规划) 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档,包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
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
01beibao
- 01背包问题,里面有四种算法,分别为动态规划,分支限定发,回溯法和谈新算法!-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
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 algo
sa_01
- 本程序是在MATLAB平台上面实现的用模拟退火算法解决01背包问题。-This procedure is in the MATLAB platform achieved with simulated annealing algorithm to solve knapsack problem 01.
Knapsack
- 背包问题,一个不错的动态规划算法显示,值得一看-Knapsack problem, a good dynamic programming algorithm indicates that worth a visit
xujinpeng-matlab
- 遗传算法编程求解旅行商问题;图论中最短路问题的Matlab程序实现;背包问题模型的Matlab程序实现。-Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab
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.
GQA
- 遗传量子算法求解背包问题Matlab源码-Quantum Genetic Algorithm for Knapsack Problem
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
matlab
- 不错的程序,欢迎下载,登山算法,解决背包问题,不错-Good program, please download, climbing algorithm to solve knapsack problem, yes