搜索资源列表
dongtaiguihuqiubeibaowenti
- 动态规划求0/1背包问题,是一个或多个物品的重量和价值,数组中的每个元素定义一趟需要记录的数据-Dynamic programming 0/1 knapsack problem is the weight and value of one or more items, each array element defines a trip record data
test
- 模拟退火算法求解0-1背包问题。模拟退火算法求解0-1背包问题-Simulated annealing algorithm for solving knapsack problem
PSO
- matlab求解粒子群，属于0-1背包问题-matlab to solve the particle swarm, belonging to the 0-1 knapsack problem
Bag
- 0-1背包问题的解答,0-1背包问题的一个简单的解答，算法不是很好，蛮力算法-0-1 knapsack problem answers to the 0-1 knapsack problem with a simple answer, the algorithm is not very good, the brute force algorithm
knapsack01_backtrack
- 数据结构中回溯法求解0-1背包问题的实现-Backtracking to the 0-1 knapsack problem in the data structure
PackageProblem
- 0-1背包问题经典解答，有界面，有具体执行算法。-0-1 knapsack problem the classic answer, interface, and the specific implementation of the algorithm.
01Bags_BinaryTress
- 自己写的用二叉树处理经典的0-1背包问题的程序。-Write your own binary tree processing procedures of the classical 0-1 knapsack problem.
Recursive-loop
- 是学习递归循环用法的很好的几个实例，包括经典的0-1背包问题，8皇后问题，概率问题等等，相信能帮助你更好的理解C中递归循环的实现。-Learning recursive cycle usage of several instances, including the classical 0-1 knapsack problem, the eight queens problem, probability problems, I believe it can help you understand
0_1beibao
- 分别用回溯法和动态规划解决0-1背包问题，输出装入背包的顺序-Backtracking and dynamic programming to solve the 0-1 knapsack problem, the order in which the output is loaded backpack
knap-error
- 利用回溯法解决0-1背包问题，希望对于开始学习算法的同学有所帮助-Backtracking to solve 0-1 knapsack problem, I hope to help students start learning algorithm
huisu
- 0-1背包问题的回溯算法，算法分析与设计-0-1 knapsack problem backtracking algorithm, algorithm analysis and design
01dongtaiguihua
- 0-1背包问题的动态规划算法，算法分析与设计-0-1 knapsack problem dynamic programming algorithm, algorithm analysis and design
01tanxin
- 0-1背包问题的贪心算法，算法分析与设计-0-1 knapsack problem of the greedy algorithm, algorithm analysis and design
backpack
- 动态规划实现0-1背包问题和贪心法实现背包问题-Dynamic programming to realize knapsack problem and greedy method to realize knapsack problem
12-01bag
- 01背包问题 问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。 问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树
beibao22
- 0.1背包问题有多种揭发，这应该是最简单的一种，很容易的写法-Variety expose of 0.1 knapsack problem, which should be the most simple, it is easy wording
SAPSO
- 0-1背包问题是学习算法时一个非常常用的简单问题，可以用多种智能优化算法实现，这里用到了蚁群算法和模拟退火算法还有两种方法的结合三种方法来实现。-0-1 knapsack problem is a simple learning algorithm is a very common problem, and can use a variety of intelligent optimization algorithm, ant colony algorithm and simulated ann
daima
- 动态规划，贪心算法和回溯解决0-1背包问题-Dynamic programming, greedy algorithms and backtracking to solve 0-1 knapsack problem
01-backpack
- ACM算法问题：0-1背包问题。此代码用vc++b编写。-ACM algorithm problem :0-1 of the knapsack problem. Write this code vc++b.
knapsack
- 利用遗传算法解决0-1背包问题的c++程序代码-Genetic algorithm to solve the knapsack problem c++ program