搜索资源列表
beibaobeibao
- 这是一个0/1背包问题的解决,有图形界面,是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
Algorithms
- 算法导论上机作业java实现,主要有背包问题,八皇后问题,递归等。-Introduction to the machine operation algorithm java to achieve, there are knapsack problem, the eight queen problem, recursive and so on.
pacel
- 经典问题----背包问题的java源代码,求解-Knapsack problem---- the classic problem of the java source code, to solve
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
an
- 利用模拟退火解决0-1背包问题,适合初学者。-The use of simulated annealing to solve 0-1 knapsack problem, suitable for beginners.
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
beibao
- 通过贪心算法实现背包问题,可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
EX04
- 遗传算法,用此算法可以得到很多计算背包问题的方法,可以和其他的算法进行比较。-Genetic algorithm, using this algorithm for calculating the backpack can be a lot of problems, and other algorithms can be compared.
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, respectively (W1, W2, ..., Wn).
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
package
- 动态规划的背包问题,包括讲解,源代码还有详细的例证。-Dynamic programming knapsack problem, including explanations, there is a detailed source code examples.
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 algorithm optimization algorithm t
beibaowent
- 一群算法解决背包问题 -A group of algorithms to solve knapsack problem a group of algorithms to solve knapsack problem
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 realization of genetic algorith
TSP
- 解决背包问题 自动求解最大价值 利益最大化问题-Automatically solve the Knapsack Problem to maximize the interests of maximizing the value of solving the problem