Location:
Search - 分支限界
Search list
Description: 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis
Platform: |
Size: 17167 |
Author: 老七 |
Hits:
Description: 算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC + + prepared
Platform: |
Size: 2934 |
Author: ddd |
Hits:
Description: 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC + + prepared
Platform: |
Size: 10813 |
Author: ddd |
Hits:
Description: 解决旅行售货员问题的优先队列式分支限界法C++源程序
Platform: |
Size: 2376 |
Author: key4lock |
Hits:
Description: 分支限界法求解TSP问题[15]
分支限界法类又称为剪枝限界法或分支定界法，它类似于回溯法，也是一种在问题的解空间树T上搜索问题解的算法。它与回溯法有两点不同：①回溯法只通过约束条件剪去非可行解，而分支限界法不仅通过约束条件，而且通过目标函数的限界来减少无效搜索，也就是剪掉了某些不包含最优解的可行解。②在解空间树上的搜索方式也不相同。回溯法以深度优先的方式搜索解空间树，而分支限界法则以广度优先或以最小耗费优先的方式搜索解空间树。分支限界法的搜索策略是：在扩展结点处，先生成其所有的儿子结点（分支），然后再从当前的活结点表中选择下一个扩展结点。为了有效地选择下一扩展结点，以加速搜索的进程，
在每一活结点处，计算一个函数值（限界），并根据这些已计算出的函数值，从当前活结点表中选择一个最有利的结点作为扩展结点，使搜索朝着解空间树上有最优解的分支推进，以便尽快地找出一个最优解。
Platform: |
Size: 1163094 |
Author: paul2204@qq.com |
Hits:
Description: 最小圆排列的分支限界法！ 用了很好的剪支策略很快的！-smallest circle with a branch and bound method! With a good strategy for cutting sticks soon!
Platform: |
Size: 2048 |
Author: 王乐 |
Hits:
Description: 算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared
Platform: |
Size: 3072 |
Author: ddd |
Hits:
Description: 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC++ prepared
Platform: |
Size: 10240 |
Author: ddd |
Hits:
Description: 用vc编写的解决计算机算法中的分支限界问题，非常经典的代码，请多多指教！-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
Platform: |
Size: 498688 |
Author: 徐子正 |
Hits:
Description: 本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.
Platform: |
Size: 23552 |
Author: chen |
Hits:
Description: 六 程序实现：
#include <stdio.h>
typedef struct {
int row
int col
}Position
int FindPath (Position start, Position finish, int &PathLen, Position *&path)
{ //计算从起始位置start到目标位置finish的最短布线路径，找到返回1，否则，返回0
int i
if ((start.row = = finish.row) && (start.col = = finish.col)) {
PathLen = 0 return 0 } //start = finish
//设置方格阵列”围墙”
for (i = 0 i <= m+1 i++)
grid[0][i] = grid[n+1
-6 program :# include
Platform: |
Size: 11264 |
Author: 敖斌 |
Hits:
Description: 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis
Platform: |
Size: 17408 |
Author: 老七 |
Hits:
Description: 最小重量机器设计问题
设某一机器由n个部件组成，每一种部件都可以从m个不同的供应商处购得。设w(i,j)是从供应商j处购得的部件i的重量,C(i,j)是相应的价格。
设计一个优先列式分支限界法，给出总价格不超过c的最小重量机器设计。-minimum weight machines based design of a machine n components, each component can be 000 m from different vendors purchased. Let w (i, j) is from the supplier j purchased components of the weight i, C (i, j) is the corresponding price. Design a priority out-branch and bound method, the total price is less than the minimum weight c machine design.
Platform: |
Size: 2048 |
Author: 卢起雪 |
Hits:
Description: 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
Platform: |
Size: 16384 |
Author: EllenGong |
Hits:
Description: 四种算法求最短路径的例子，C#，图形演示
分别为贪心发，动态规划发，分支限界法，和回溯法-Four shortest path algorithm for example, C#, Graphical presentations were greedy fat, fat, dynamic programming, branch and bound method, and backtracking
Platform: |
Size: 24576 |
Author: tp |
Hits:
Description: 布线问题(分支限界算法应用) -Wiring problems (branch and bound algorithm for the application)
Platform: |
Size: 11264 |
Author: jacky |
Hits:
Description: 布线问题(分支限界算法应用)-Wiring problems (branch and bound algorithm for the application)
Platform: |
Size: 3072 |
Author: jacky |
Hits:
Description: 对于给顶的仓库局,以及仓库管理员在仓库中的位置和箱子的开始位置和目标位置,设计一个解推箱子问题的分支限界法,计算出仓库管理员将箱子从开始位置推到目标位置所需的最少推动次数.-To the top of the warehouse for the Board, as well as the warehouse manager in the warehouse location and the beginning of the box location and target location, the design of a solution of the problem Sokoban branch and bound method to calculate the storage administrator will be the location of boxes from the beginning to the target location the minimum number required to promote.
Platform: |
Size: 2048 |
Author: 李靖平 |
Hits:
Description: 连续邮资问题,采用分支限界法编写,java实现-Postage consecutive issues, the use of branch and bound method to prepare, java realize
Platform: |
Size: 3072 |
Author: zhanghan |
Hits:
Description: 用分支限界法求解背包问题（0/1背包）
1.问题描述：已知有N个物品和一个可以容纳TOT重量的背包，每种物品I的重量为Weight，价值为Value。一个只能全放入或者不放入，求解如何放入物品，可以使背包里的物品的总价值最大。
2.设计思想与分析：对物品的选取与否构成一棵解树，左子树表示装入，右表示不装入，通过检索问题的解树得出最优解，并用结点上界杀死不符合要求的结点。-Using branch and bound method to solve knapsack problem (0/1 knapsack) 1. Problem Description: known to have N of items and a TOT can accommodate the weight of backpacks, the weight of each item I for Weight, the value of Value. Add a can or not Add-wide, to solve how to Add items, the backpack can make the total value of the largest items. 2. The design and analysis: the selection of items or not constitute a solution tree, into the left subtree said, indicated that he did not load right, through the solution search tree reached the optimal solution, and the upper bound of node to kill refuses to comply with the requirements of nodes.
Platform: |
Size: 1024 |
Author: 黄勇 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
13
»