搜索资源列表
0-1package
- 遗传算法求解0-1背包问题，包含问题的求解步骤。-Genetic Algorithm 0-1 knapsack problem, including steps to solve the problem.
A_solution_to-knapsack-problem
- 背包问题是组合优化领域内经典的NP完备间题,本文介绍了pso解决0/1背包问题上的一个方法
Fractional_Knapsack
- 谈心算法实现0/1背包问题的解决，想学习谈心算法的可以参考
knapsack.rar
- 用GAlib库实现的解决0/1背包问题的遗传算法程序源代码。, Solution 0/1 knapsack question heredity algorithm procedure source code realizes which with the GAlib storehouse.
0-1beibaowenti
- 用C#编写的利用遗传算法解决0-1背包问题的源程序，希望对需要的朋友有所帮助-C# prepared with the use of genetic algorithm to solve the 0-1 knapsack problem source, and they hope to help a friend in need
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
ACO_0_1_bag
- 蚁群算法解0-1背包问题 内附测试文件 解的质量一般叫好，但是背包数增加时，耗时较长-Ant Colony Algorithm for 0-1 Knapsack Problem solution document containing test the quality of the general good, but the increase in the number of backpack, the longer time-consuming
beibao
- 采用遗传算法解决0-1背包问题，即装入物体容量有限，每个物体有不同价值，使得最终价值最高-Using genetic algorithm to solve the 0-1 knapsack problem, that is, limited capacity into objects, each object has a different value, making the final value of the maximum
ACO
- 蚁群算法解决0-1背包问题,是一个比较小的程序，运行过，没有问题的。-the solving method of zero to one backage with ACO.It is a small programe for the zero to one problem.
0-1-back-pag-problem
- 背包问题 主要是应用了回溯的算法实现的 还用到了栈的思想-Knapsack problem is the application of backtracking algorithm are also thought to use a stack
Genetic_Algorithm_0_1knapProblem
- 0-1背包问题是个NP难问题，本程序基于遗传算法，求解0——1背包问题。-Solve 0_1 knap problem with genetic algorithm
39975737MATLAB_gatool
- 解决0-1背包问题的遗传算法matlab程序，欢迎交流提高。-Solve the 0-1 knapsack problem genetic algorithm matlab program, welcomed the exchange increased.
ANT-TX
- 用蚁群算法和贪心算法解决0/1背包问题。可用于不同算法的比较。-Solving 0/1 Knapsack Problem by ant colony algorithm and greed method.Can be used to compare two algorithms.
algorithm_report
- 算法分析与设计报告，用java编写的4个常见的算法小程序。包括矩阵相乘问题，0/1背包问题，删数问题，和旅行商问题。-Algorithm analysis and design reports using java prepared four common algorithm applet. Including matrix multiplication problem, 0/1 knapsack problem, delete a few problems, and traveling sal
Ant
- 用蚁群算法解决0-1背包问题。 用蚁群算法解决0-1背包问题。-Using ant colony algorithm to solve 0-1 knapsack problem.
Ant
- 用蚁群算法解决0-1背包问题。 -Using ant colony algorithm to solve 0-1 knapsack problem.
ACG0-1
- 蚁群求解TSP问题，和0-1背包问题，不错，运行结果可以-ACO for TSP, and the 0-1 knapsack problem, yes, the results can be
0-1beibao
- 蚁群算法求解0-1背包问题，压缩包中有详细的代码和实验报告，可以调试运行-Ant Colony Algorithm for the 0-1 knapsack problem, compressed package are detailed in the code and lab reports, debugging and running
SA0-1
- 模拟退火解决0—1背包问题，很好的套用模版-Simulated annealing to solve the 0-1 knapsack problem, apply the template
pso0-1
- 粒子群算法解决0-1背包问题，输出最优解，适合初学者-Particle swarm algorithm to solve knapsack problem, suitable for beginners to see. . . . . . . . . . . . . . . . . . . . . . . .