搜索资源列表
用混和遗传算法求解背包问题
- 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。
01背包
- 01背包问题算法
贪心遗传算法求解背包问题
- 把贪心算法和遗传算法相结合，从而得出对NP难题的背包问题进行优化求解。
背包问题的贪心算法
- 背包问题的贪心算法
遗传算法求解背包问题.doc
- 遗传算法求解背包问题遗传算法求解背包问题.doc.doc
knapsack.rar
- 用GAlib库实现的解决0/1背包问题的遗传算法程序源代码。, Solution 0/1 knapsack question heredity algorithm procedure source code realizes which with the GAlib storehouse.
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
matlab.rar
- 不错的程序，欢迎下载，登山算法，解决背包问题，不错,Good program, please download, climbing algorithm to solve knapsack problem, yes
beibaowenti.rar
- 量子免疫克隆用于求解背包问题 绝对私密 欢迎大家分享 下载,Quantum immune clone backpack for solving the problem is welcome to share download private
解决0-1背包问题
- 解决0-1背包问题，是算法设计与分析5.6节内容-Solve the 0-1 knapsack problem
xujinpeng-matlab.rar
- 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。,Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
0-1Knapsack.problem
- Knapsack problemnew01背包问题（动态规划） 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
test-data-for-01-knapscap-problem
- 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
背包问题用lc分支限界方法
- 01背包问题，用lc分支限界方法，做的ppt-01 knapsack problem, using lc branch and bound method, do ppt
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
beibaobeibao
- 这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
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-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone