Welcome![Sign In][Sign Up]
Location:
Search - knapsack branch bound code

Search list

[Data structs01package

Description: 背包问题优先队列分枝限界算法 所谓的背包问题,可以描述如下:一个小偷打劫一个保险箱,发现柜子里有N类不同大小与价值的物品,但小偷只有一个容积为M的背包来装东西,背包问题就是要找出一个小偷选择所偷物品的组合,以使偷走的物品总价值最大。这个问题的求解有很多种方法,本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as follows : a thief robbed a safe, found N closets, a different type size and value of the items, but the thieves only one volume of M backpack to hold things. knapsack problem is to identify a thief stole items chosen by the portfolio, so that stolen goods worth largest. Solving this problem is many ways, the procedures used Branch and Bound method.
Platform: | Size: 238592 | Author: 王涛 | Hits:

[matlabjuxingfenzhi

Description: 这是矩形分支定界算法,采用matlab语言环境-branch and bound algorithm, using Matlab language environment
Platform: | Size: 1024 | Author: zhangmin | Hits:

[Other01beibao

Description: 这是一个用分支限界法实线01背包问题的说明文档,包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
Platform: | Size: 22528 | Author: lius | Hits:

[Data structs55

Description: 背包问题分枝界限算法的源代码 其中包括背包容量、下限、剩余容量、当前价值之和 等-Branch-and-bound algorithm for knapsack problem of the source code including backpack capacity, the lower limit, the remaining capacity, the current value and so on
Platform: | Size: 2048 | Author: 李辉 | Hits:

[JSP/JavaKnapsack

Description: 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
Platform: | Size: 2048 | Author: L | Hits:

[JSP/Java0_1Knasack

Description: 比较了求解0-1背包问题常用的几种算法,并用回溯法和分支限界法进行了Java编程实现,给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
Platform: | Size: 212992 | Author: 谢斌 | Hits:

[Data structssuanfa2

Description: 分支限界法、分治法、动态规划法常见代码,素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscript.
Platform: | Size: 41812992 | Author: 李诗诗 | Hits:

[Data structs01packet

Description: 使用分支限界法解决01背包问题,c++代码实现,能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
Platform: | Size: 897024 | Author: Rhonda | Hits:

[Otherfenzhixianjie

Description: 分支限界法实现0-1背包问题源代码测试通过-Source code testing by branch and bound 0-1 knapsack problem
Platform: | Size: 1024 | Author: ygc | Hits:

[JSP/JavaKnapsack

Description: 用java实现的01背包问题的有分支限界的回溯算法,注释非常详细,是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorithms and data structures
Platform: | Size: 2048 | Author: xuchao | Hits:

[VC/MFCCode-four-methods-knapsack-problem

Description: 背包问题的四种实现代码 动态规划 贪婪算法 回溯法 分支限界法-Four knapsack problem dynamic programming code backtracking greedy algorithm branch and bound method
Platform: | Size: 94208 | Author: mulanjingqian | Hits:

CodeBus www.codebus.net