搜索资源列表
0-1beibaowenti(fenzhijiexiansuanfa)
- 本程序采用分支界限算法解决经典的0-1背包问题。-This program uses the branch and bound algorithm to solve the classical 0-1 knapsack problem.
0-1Package_c
- 0-1背包问题，C语言代码，txt文本，可以改编-0-1 package problem
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
0-1bag-queastion
- 0-1背包问题 0-1背包问题的c++实现源代码 简单实用 -0-1bag queastion
0-1-beibao-
- 0。1 背包问题，带有输入说明，和程序详细解释-0.1 knapsack problem, with input instructions, and procedures explained in detail
0-1bag
- 0—1背包问题，实现了经典背包问题.只是一个非常值得参考的算法。该算法简洁易懂，代码重用性强！-kanpsack problem which is a good algorithm for 0-1 kanosack problem!
SA0-1
- 模拟退火解决0—1背包问题，很好的套用模版-Simulated annealing to solve the 0-1 knapsack problem, apply the template
0-1packets
- 一个算法的实现：使用分支界限法求解0-1背包问题-The realization of an algorithm: 0-1 knapsack problem using the branch and bound method
0-1bag
- 算法课程中的经典案例 0-1背包问题 采用动态规划思想解决-A classic case of the algorithm courses 0-1 knapsack problem using dynamic programming to solve
0-1beibaowenti
- 用C++编的关于0-1背包问题的源程序，程序可以运行-Source on the 0-1 knapsack problem compiled C++ used, the program can run
BackpackTH(1)
- 退火算法实现0/1背包问题求解，java编写，eclipse中编写，工程文件齐全，界面清楚，运行结果正确-Annealing algorithm to achieve the 0/1 knapsack problem solving, writing java eclipse write engineering documents, clear interface, the results are correct
0-1packet
- 实现0—1背包问题，使用动态规划，有注释。-0-1 knapsack problem, the use of dynamic programming, there are notes.
pso0-1
- 粒子群算法解决0-1背包问题，输出最优解，适合初学者-Particle swarm algorithm to solve knapsack problem, suitable for beginners to see. . . . . . . . . . . . . . . . . . . . . . . .
0-1Jump
- 用动态规划去解答0-1背包问题，此方法是在经典背包问题上进行的跳跃点优化而解答出来的，已成功通过编译调试-Using dynamic programming to answer 0-1 knapsack problem, this method is carried out on the classic knapsack problem jumps out optimization solutions, has successfully passed the compiler debugging
0-1bag
- 0-1背包问题：有N件物品和一个容量为V的背包。第i件物品的花费是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。-The 0-1 knapsack problem: N items and a capacity of V backpack. Take the first I items is c[i], the value is w[i]. For which goods loaded backpack can make the value of the sum of the
0-1bag
- 经典的0-1背包问题，程序可以自动输入并且有注释-Classical 0-1 knapsack problem, the program can automatically entered and annotated
0-1beibao--QGA
- 基于量子遗传算法的0-1背包问题matlab-Matlab genetic algorithm based on quantum 0-1 knapsack problem
0-1package
- 0-1背包问题，C++编码,0-1背包问题的经典解决办法-0-1 knapsack problem, C++ ,0-1 encoding classical knapsack problem solutions
0-1knapsack
- 0-1背包问题，通过C语言实现，可以实现0-1背包排序的问题-The problam about 0-1knapsack