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: 9084 |
Author:王涛 |
Hits:
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: 运动员最佳配对问题,无和集问题,整数变换问题,无优先级运算,0-1背包问题-Athletes the best matching problems, and sets no problem, Integer Transform problem, no priority computing ,0-1 Knapsack Problem Platform: |
Size: 150528 |
Author:赵冉 |
Hits:
Description: 此文件夹中共包括十二个小程序
AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除
Boyer_Moore算法的串模式匹配
Horspool算法的串模式匹配
Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历
HeapSort利用堆排序实现优先级队列
Merge实现二路归并排序算法
MFK动态规划解背包问题
nqueue求解n皇后问题
QuickSort快速排序算法的实现。
Shell排序算法的实现。
Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。
tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package Platform: |
Size: 374784 |
Author:zouyan |
Hits:
Description: 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program Platform: |
Size: 778240 |
Author:hudongfang |
Hits:
Description: 解决0-1背包问题的几种方法,有回溯,有优先分支界限,是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report Platform: |
Size: 46080 |
Author:lovewuhui |
Hits:
Description: 最少背包问题:假设有许多盒子,每个盒子能保存的总重量为1.0。有N个项i1,i2,…,iN,它们的重量分别是w1,w2,…,wN。目的是用尽可能少的盒子放入所有的项,任何盒子的重量不能超过他的容量。例如,如果想的重量为0.4, 0.4, 0.6和0.6,用两个盒子就能解决。
按如下策略解决此问题:按给定的次序扫描每一个项,把每一个项放入能够容纳他而不至于溢出的最满的盒子。用优先级队列选择要装入的盒子。-Minimum knapsack problem: Suppose there are many boxes, each box can hold a total weight of 1.0. There are N items i1, i2, ..., iN, their weight are w1, w2, ..., wN. Purpose is to use as little as possible of all the items into the box, any box weight can not exceed his capacity. For example, if you want the weight of 0.4, 0.4, 0.6 and 0.6, with the two boxes can be solved. Strategy to solve this problem as follows: given the order by scanning each item, put each item into him and will not be able to accommodate the overflow of the most full of boxes. With a priority queue to select into the box. Platform: |
Size: 2048 |
Author:lijinping |
Hits:
Description: 实现了最小背包问题的解决,利用优先级队列来解决-Achieve a minimum knapsack problem, the use of priority queues to resolve Platform: |
Size: 2048 |
Author:stendardo |
Hits: