搜索资源列表
01bag
- 用蛮力法,回溯法,分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
BackTrack_01backpack
- 0-1背包问题是一个经典的算法问题,有多种解法,这里用回溯法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved by backtracking.
0-1hui
- 0-1背包问题 关于回溯法的背包问题 回溯法在求问题的所有解时, 要回溯到根结点, 且根结点的所有子树都已被搜索过才结束。-0-1 背包问题
galy
- 遗传算法解决的背包问题,初学者遗传算法的同学必看。-Genetic algorithm to solve the knapsack problem, genetic algorithm beginner students must-see.
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题,遗传算法,基于遗传算法的背包问题求解-Knapsack problem, genetic algorithm, based on genetic algorithms for solving knapsack problem
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题,遗传算法,GAs,基于遗传算法求解背包问题,源码,方法-Knapsack problem, genetic algorithms, GAs, Knapsack Problem Based on Genetic Algorithm
DP
- 算法设计的经典问题,动态规划算法,实现0-1背包问题-Classic problem of algorithm design, dynamic programming algorithm to achieve the 0-1 knapsack problem
knapsack
- 对于0—1背包问题问题利用动态规划法在C++中进行编程解决。-Knapsacks
0-1beibao
- 这是用贪心算法解决0-1背包问题的一个算法源码-something about 0-1 knapsack problems
01bag
- 0-1背包问题算法,采用动态规划思想实现。-the Algorithm of 0-1bag problem,it is implemented with Dynamic programming.
1
- 背包问题体现了一种游戏规则透露游戏的本质-自动翻译
01pack
- 0-1背包问题:给定n种物品和一个背包。物品i的重量是Wi,其价值为Vi,背包的容量为C。应如何选择装入背包的物品,使得装入背包中物品的总价值最大?在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包为1或不装入背包为0.不能将物品i装入背包多次,也不能只装入部分物品i。-0-1 pack
Knapsack
- 0-1背包的回溯算法,c++实现-0-1 backtracking algorithm backpack, c++ implementation. . .
0-1_bag_problem
- 0-1背包问题的动态规划解法,C++源码,并附有详细的实验报告-0-1 bag problem
01
- c++利用回溯法来实现01背包问题 阶段是:在前N件物品中,选取若干件物品放入背包中; 状态是:在前N件物品中,选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值; 决策是:第N件物品放或者不放; -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of it
knapbranch
- 0-1背包问题的分支定界算法实现。包含优先队列的实现细节。-0-1 knapsack problem branch and bound algorithm. Priority queue that contains the implementation details.
knapdynamicprogram
- 0-1背包问题的动态规划算法实现。包含1维及2维0-1背包问题。-0-1 knapsack problem dynamic programming algorithm. Contains 1-D and 2-dimensional 0-1 knapsack problem.
0-1beibao
- 0-1背包问题,很经典的一个问题,基于动态规划的经典案例。-0-1 knapsack problem, it is a problem in the classic, classic case based on dynamic programming.
0-1-back-pag-problem
- 背包问题 主要是应用了回溯的算法实现的 还用到了栈的思想-Knapsack problem is the application of backtracking algorithm are also thought to use a stack