搜索资源列表
LCKNAP
- 01背包问题的优先队列式分枝限界算法程序LCKNAP-01 knapsack problem the priority queue algorithm Branch and Bound-style program LCKNAP
dividablepackage
- 此程序是使用Java编写的，实现了可分割的0/1背包问题。程序主要是是使用了经典的贪心算法，能够很好的解决此问题。-This procedure is to use Java prepared to achieve that can be separated from 0/1 knapsack problem. Procedure is mainly the use of a classic greedy algorithm that
Solving.the.01.Knapsack.Problem.with.Genetic.Algor
- 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever,
01beibao
- 0-1背包问题，用VC++实现，是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue
beibao
- 背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program
Algorithms
- 算法导论上机作业java实现，主要有背包问题，八皇后问题，递归等。-Introduction to the machine operation algorithm java to achieve, there are knapsack problem, the eight queen problem, recursive and so on.
Knapsack
- 用遗传算法解决01背包问题，内附测试数据。-Using genetic algorithms to solve knapsack problem 01, enclosing the test data.
SimulatedAnnealingAlgorithm
- matlab编制的用模拟退火算法解决0-1背包问题的具体实例-matlab prepared using simulated annealing algorithm to solve 0-1 knapsack problem specific examples of
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
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
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!
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
BeiBao1
- 动态规划算法求解0-1背包问题,动态规划算法knapsack求最优值-Dynamic programming algorithm for solving 0-1 knapsack problem, dynamic programming algorithm for optimal value knapsack
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.