搜索资源列表
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
0-1bag
- 运用贪心算法解决0-1背包问题; 运用回溯法解决0-1背包问题; 运用分支界限法解决0-1背包问题。 -Use greedy algorithm to solve 0-1 knapsack problem Use backtracking to solve the 0-1 knapsack problem Using the branch and bound method to solve the 0-1 knapsack problem.
dfs0-1
- dfs回溯方法解决0-1背包问题。 对比dp减小了空间复杂度-dfs 0- 1
GA0-1
- 0-1背包问题遗传算法,包含精英选择和非精英选择-0-1 knapsack problem algorithms, comprising elite and non-elite choose
0-1knapsack
- 动态规划0-1背包问题 列表法并且测试时间代价-0-1 knapsack problem dynamic programming
0-1beibaowenti
- 应用禁忌搜索算法解决0-1背包问题,可以快速得到最优结果,用matlab实现-Application of tabu search algorithm to solve 0-1 knapsack problem, you can quickly get the best results, using matlab realize
0-1knapsack-problem
- 这是一个简单的0-1背包问题,采用matlab编程,使用模拟退火算法求解,结果精确快速,并可以应用到很多其他问题-This is a simple 0-1 knapsack problem, using matlab programming, simulated annealing algorithm, accurate results quickly, and can be applied to many other problems
0-1backbag
- 北邮算法设计与分析第三章上机作业 关于0-1背包问题的具体算法-BUPT algorithm design and analysis of the third chapter on machine operation on specific algorithms 0-1 Knapsack Problem
0-1_package_problem
- 0-1背包问题:使用动态规划算法进行求解0-1背包问题-0-1 Knapsack Problem: Solve the 0-1 knapsack problem using a dynamic programming algorithm
0-1beibao
- 这是用MFC写的,开发环境是VC++。有软件界面,主要用于求解0-1背包问题,亲测无误。-This is written in MFC, and the development environment is VC++. It has software interface, mainly for solving 0-1 knapsack problem.