搜索资源列表
Knapsack
- 用遗传算法解决01背包问题，内附测试数据。-Using genetic algorithms to solve knapsack problem 01, enclosing the test data.
an
- 利用模拟退火解决0-1背包问题，适合初学者。-The use of simulated annealing to solve 0-1 knapsack problem, suitable for beginners.
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
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
EX04
- 遗传算法，用此算法可以得到很多计算背包问题的方法，可以和其他的算法进行比较。-Genetic algorithm, using this algorithm for calculating the backpack can be a lot of problems, and other algorithms can be compared.
01beibao
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
pack
- 一个简化的背包问题：一个背包能装总重量为 T，现有 n 个物件，其重量分别为（W1、W2、…、Wn）。问能否从这 n 个物件中挑选若干个物件放入背包中，使其总重量正好为 T ？若有解则给出全部解，否则输出无解。-A simplified knapsack problem: a backpack can hold a total weight for the T, the existing n-object, its weight, re
01knapsackMFC
- 01背包问题演示程序 用mfc实现01背包问题的dp算法-01 knapsack problem with mfc demo program to achieve 01 knapsack problem algorithm dp
Fac3_9
- //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
gafor01
- 遗传算法求解典型的组合优化问题，复杂背包问题的设计-Genetic Algorithm for typical combinatorial optimization problem, the complexity of the design of knapsack problem
KnapsacksProblem1
- 利用遗传算法解决背包问题，对遗传算法和编程的学习有一定帮助-The use of genetic algorithms to solve knapsack problem, genetic algorithms and programming of learning to some extent help the
GA
- 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algo
beibaowent
- 一群算法解决背包问题 -A group of algorithms to solve knapsack problem a group of algorithms to solve knapsack problem
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
Beibao-JAVA
- 提供一个用Java实现背包问题的解法，如果有必要可以自行修改相关参数后再做仿真-Used to provide a Java implementation of the solution of knapsack problem and, if necessary modify the relevant parameters can then make simulation
gabags
- 网站上关于遗传算法开发可谓工具箱满天飞。可工具箱超级难用。鉴于此，本人自己完全用matlab实现遗传算法解决多背包问题并留了qq。-Web site development on the genetic algorithm toolbox is all over the place. Toolbox can be super hard to use. In view of this, I am not at all with the r
beibao
- 背包问题的主函数很有用啊 本程序主要用到遗传算法-背包
a
- 简单的背包问题，用了回溯，里面有详细的解说-aaaaaaaaaaaaaaaaaaaaaaaaaaa