Location:
Search - 01bag
Search list
Description: 经常遇到01背包的问题我在这里向大家提供该算法实现的具体过程-01 backpack often encountered the problem I am here to provide you with the algorithm to achieve the specific process
Platform: |
Size: 834 |
Author: 张三华 |
Hits:
Description: 01背包问题c语言实现
01背包问题c语言实现
Platform: |
Size: 1060 |
Author: dawn |
Hits:
Description: 经常遇到01背包的问题我在这里向大家提供该算法实现的具体过程-01 backpack often encountered the problem I am here to provide you with the algorithm to achieve the specific process
Platform: |
Size: 1024 |
Author: 张三华 |
Hits:
Description: 数据结构配套C代码,严慰敏,陈文博编著的数据结构及应该用算法教程-data structure supporting C code, Yan Wei Min Xu compilation of the data structure and algorithm should be used Guide
Platform: |
Size: 504832 |
Author: soul |
Hits:
Description: 01背包问题c语言实现
01背包问题c语言实现-01 knapsack problem c language c language of 01 knapsack problem implementation
Platform: |
Size: 1024 |
Author: dawn |
Hits:
Description: 用回溯方法写的01背包问题，有中文注释，很容易懂！-Methods used to write back the 01 knapsack problem, a Chinese note, it is easy to understand!
Platform: |
Size: 899072 |
Author: 吴男 |
Hits:
Description: 01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack
Platform: |
Size: 7168 |
Author: 刘建林 |
Hits:
Description: 01背包 用C++编写的,还需大家指点 呵呵呆-01bag
Platform: |
Size: 546816 |
Author: fcwindpasss |
Hits:
Description: 使用动态规划方法解决01背包问题 比较简单的程序 -Using dynamic programming solution to 01 knapsack problem relatively simple procedure
Platform: |
Size: 141312 |
Author: smile |
Hits:
Description: 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
Platform: |
Size: 1052672 |
Author: hehuiling |
Hits:
Description: 0-1背包问题算法,采用动态规划思想实现。-the Algorithm of 0-1bag problem,it is implemented with Dynamic programming.
Platform: |
Size: 243712 |
Author: hansun |
Hits:
Description: 实现经典0-1背包问题，采用动态规划、分枝限界、回溯法、贪心算法等四个算法分别实现0-1背包问题，并有一个四合一的算法统一用四种方法实现。并对其时间复杂度进行了分析。-To achieve the classic 0-1 knapsack problem, dynamic programming, branch and bound, backtracking, greedy algorithm to achieve the four algorithms are 0-1 knapsack problem, and there is a Four in One of the four methods used to achieve a unified algorithm. And its time complexity is analyzed.
Platform: |
Size: 226304 |
Author: liuyongzhong |
Hits:
Description: 0-1背包问题，采用了动态规划的算法，输入物品的重量和价值，以及背包的容量，计算出最优解-0-1 knapsack problem, using a dynamic programming algorithm ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~~
Platform: |
Size: 1024 |
Author: 陈昕昀 |
Hits:
Description: 01背包问题：从这n件物品中选择若干件放入此背包，使得放入的重量之和正好为S。-01 knapsack problem: n items selected from a number of pieces into the bag, so just put the weight of the sum of S.
Platform: |
Size: 1024 |
Author: Mr Xu |
Hits:
Description: 动态规划经典问题01背包的实现，用2种实现算法。一是用递归，二是用循环。还有01背包算法的叙述和图解，通俗易懂-Dynamic programming
01bag
Platform: |
Size: 37888 |
Author: sx |
Hits:
Description: 01背包问题,用最简单的算法解决了01背包问题-01bag question
Platform: |
Size: 1024 |
Author: 小五 |
Hits:
Description: 01背包问题基础代码，在各大oj上有相似题目-01 knapsack problem underlying code
Platform: |
Size: 416768 |
Author: 杨伟健 |
Hits:
Description: 01背包问题
问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。
问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树剪去。
-01 knapsack problem problem statement: given n kinds of items, and a backpack, the weight of the items i wi, the value of vi, backpack capacity C. Reasonable choice items into a backpack, making the total value of the items loaded backpack. Each item i select items loaded backpack, there are only two choices that loaded backpack or loaded backpack. Items i can not be loaded into a backpack many times not only loaded items i. The problem analysis: 01 knapsack problem is a selected subset of the problem and suitable for the tree represents a subset of the solution space of 01 knapsack problem. Search solution space tree, as long as its left son node is a feasible node, the search into the left subtree, right subtree may contain only into the right subtree search the optimal solution Otherwise, the right subtree cut.
Platform: |
Size: 313344 |
Author: Kahn |
Hits:
Description: 01 背包问题，c语言实现，计算机算法分析实习，使用的回溯法-01 knapsack problem, the C language, the computer algorithm analysis internship backtracking
Platform: |
Size: 892928 |
Author: yangyu |
Hits:
Description: 0/1背包问题，分置限界优先队列解决，C++实现。-0/1 knapsack problem, split and bound priority queue solve, C++ implementation.
Platform: |
Size: 1024 |
Author: ZR |
Hits: