搜索资源列表
0-1
- 算法设计与分析:动态规划解决0-1背包问题
0-1背包问题
- 该程序用贪心算法来求解0-1背包问题 采用贪婪准则:每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
knapsack
- 0-1背包问题,典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
0-1bag
- 实现0—1背包问题的分支限界搜索,为控制台应用程序,编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
0-1beibao
- 0-1d背包问题实验报告 完整的程序 已经运行过的 -0-1d knapsack full lab report procedure has been run-off
0-1
- 我自己用C写的一个用分支界限法实现0-1背包问题,比较简便实用,而且易懂,比回溯法有明显的优势-I have written in C, a branch and bound method 0-1 knapsack problem is relatively simple and practical, and easy to understand, there are obvious advantages than backtracking
0-1-bugs-question
- 0-1背包的几种算法的C++实现,包括分支限界、回溯法、贪心算法几种算法-Several 0-1 knapsack algorithm c++ implementation, including branch limit, backtracking algorithm and greedy algorithm
Backtracking-0-1
- 0-1背包问题的回溯法求解,0-1背包是在M件物品取出若干件放在空间为W的背包里,求出获得最大价值的方案。算法设计 回溯的思想。-Backtracking 0-1 knapsack problem solving 0-1 knapsack is removed in several pieces on items M space W backpack, determined to get the maximum value of the program. Backtracking algorit
0-1背包问题
- 0-1背包问题的实现,用HTML,js编写的算法(0-1 knapsack problem implementation, using HTML, JS algorithm written)
c++实现0-1背包问题
- 用C++工具,使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
KnapSack2
- 0/1背包问题 利用的子集树,进行穷举算法实现(0/1 knapsack exhaustive problem)
beibao
- 这是在C语言环境下利用回溯法实现0-1背包的程序(This is in the C language environment, the use of backtracking method to achieve 0-1 knapsack program)
背包问题动态规划详解
- 0/1背包问题动态规划详解及C代码 动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code Dynamic programming is the abstraction of a method of replacing time with space.)
0-1背包
- 这是一个用C++写的简单0-1背包,可供初学者学习使用(This is a simple 0-1 backpack written in c ++ that can be used by beginners)
动态规划求解0-1背包问题
- 通过动态规划的算法得到装进背包的最大价值(The maximum value of knapsack is obtained by dynamic programming algorithm.)
部分背包的贪心算法实现
- 通过贪心算法实现装进背包物品价值最大化,具体步骤是依次选择价值密度最大的物品放入背包(Through greedy algorithm to maximize the value of goods loaded into backpacks.)
0-1
- 利用动态规划实现0-1背包问题,文件包含源代码,解释说明及测试样例(Dynamic programming to achieve 0-1 knapsack problem.)
回溯法求解0-1背包问题
- 文件包括回溯法求解0-1背包问题的C++源程序,包括运行界面(The file includes a backtracking method for the C++ source program for solving 0-1 knapsack problems, including the running interface)
matlab程序(解决0-1背包问题)
- 使用遗传算法解决0-1背包问题,调试成功,非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)