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:
Description: 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program Platform: |
Size: 778240 |
Author:hudongfang |
Hits:
Description: 实现了最小背包问题的解决，利用优先级队列来解决-Achieve a minimum knapsack problem, the use of priority queues to resolve Platform: |
Size: 2048 |
Author:stendardo |
Hits:
Search - Priority Queues knapsack