Location:
Search - BranchAndBound
Search list
Description: 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
Platform: |
Size: 2048 |
Author: 谢继晖 |
Hits:
Description: 分支限界这一章的课件，经典空间，大家交流呀-Branch and bound this chapter courseware, classic space, we exchange it
Platform: |
Size: 67584 |
Author: agui |
Hits:
Description: 本程序是用分支定界法求最短路径的程序，用C++编写。采取的基本思想是：使用最小优先队列分支界限法来构建程序，细节是对于每个节点，包含三个变量：当前走过的路径长度、当前的花费和该节点对应的实际城市的编号。关于确定节点优先级，我们规定首先以“当前走过的路径长度”来确定优先级，当路径长度相等时，以“当前的花费”来确定优先级。同时，我们还定义两个数组dist[i]和pric[i]保存当前求得的从源城市到每个城市的最短距离和花费，用于剪枝时的评判标准。-This procedure is to use branch and bound procedure for seeking the shortest path, using C++ to implement. The basic idea is: Using the minimum priority queue Branch and Bound method to build a program, the details are: for each node, containing three varibles: the current path length traversed, the current cost and the node number corresponding to the actual city. On the determination of priorities, we first use the current path length traversed to determine the priority if the path length is equal, then current cost is used to determine priority. At the same time, we also define two arrays dist [i] and the pric [i] to save the current shortest distance and cost from the source city to every other city . This will be used as the evaluation criterion when pruning.
Platform: |
Size: 61440 |
Author: 李贺 |
Hits:
Description: The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the usual DFS (Depth First Search) and BFS( Breadth First Search) exploration algorithms perform a blind search of the graph. Ideally, the ranking function, c(x), ranks nodes based on the cost of a minimal solution reachable from node x. The problem with this ranking function is that the minimal solution must be known ahead of time. Instead, the ranking function uses an estimate, g(x), of the cost of a minimal solution reachable from node x. Using g(x) to rank nodes may require exploring unnecessary nodes in the graph?particularly if g(x) is not a good estimate.The final element of the ranking function measures the cost of reaching a node from the root. As the searches gets farther from the root node, the node falls in the ranking.
Platform: |
Size: 8192 |
Author: sathiyaraj124 |
Hits:
Description: branchAndBound for artificial inteligence
Platform: |
Size: 2048 |
Author: Pedro Carrano |
Hits:
Description: branchAndBound for Inteligence Artificial
Platform: |
Size: 2048 |
Author: Pedro Carrano |
Hits:
Description: 这是一个讨论旅行售货员问题的分支界限问题-This is the question the boundaries of a branch to discuss traveling salesman problem
Platform: |
Size: 403456 |
Author: 闵俊杰 |
Hits:
Description: Branch and bound method to solve the backpack problem
Platform: |
Size: 23552 |
Author: hout |
Hits: