Search - branch bound knapsack code

Search - branch bound knapsack code - List

[Data structs] 01package DL : 0: 背包问题优先队列分枝限界算法所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有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.
Date : 2025-07-12 Size : 233kb User : 王涛
[matlab] juxingfenzhi DL : 1: 这是矩形分支定界算法，采用matlab语言环境-branch and bound algorithm, using Matlab language environment
Date : 2025-07-12 Size : 1kb User : zhangmin
[Other] 01beibao DL : 0: 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
Date : 2025-07-12 Size : 22kb User : lius
[Data structs] 55 DL : 0: 背包问题分枝界限算法的源代码其中包括背包容量、下限、剩余容量、当前价值之和等-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
Date : 2025-07-12 Size : 2kb User : 李辉
[JSP/Java] Knapsack DL : 0: 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
Date : 2025-07-12 Size : 2kb User : L
[JSP/Java] 0_1Knasack DL : 0: 比较了求解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.
Date : 2025-07-12 Size : 208kb User : 谢斌
[Data structs] suanfa2 DL : 0: 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscript.
Date : 2025-07-12 Size : 39.88mb User : 李诗诗
[Data structs] 01packet DL : 0: 使用分支限界法解决01背包问题，c++代码实现，能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
Date : 2025-07-12 Size : 876kb User : Rhonda
[Other] fenzhixianjie DL : 0: 分支限界法实现0-1背包问题源代码测试通过-Source code testing by branch and bound 0-1 knapsack problem
Date : 2025-07-12 Size : 1kb User : ygc
[JSP/Java] Knapsack DL : 0: 用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
Date : 2025-07-12 Size : 2kb User : xuchao
[VC/MFC] Code-four-methods-knapsack-problem DL : 0: 背包问题的四种实现代码动态规划贪婪算法回溯法分支限界法-Four knapsack problem dynamic programming code backtracking greedy algorithm branch and bound method
Date : 2025-07-12 Size : 92kb User : mulanjingqian