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: 我的算法作业，求一个在总花费小于1500的条件下从源结点到目的结点的最短路径，源代码Tree.cpp（C++语言编写，VC++6.0 IDE下调试通过），利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose of the shortest path, Tree.cpp source code (written in C, Visual C++ 6.0 IDE debug through), use of the branch-and-bound algorithm. Note executable file Tree.exe in ReadMeFirst follow the instructions to use. Platform: |
Size: 30720 |
Author: |
Hits:
Description: 这是一个好的建模学习资料,赶快下载吧,
数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、
插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、
图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、
最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、
网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, download it quickly, mathematical modeling algorithm 10 (includes : Monte Carlo algorithm, data fitting, parameter estimation, interpolation of data-processing algorithms, linear programming, integer programming, diversity planning, Quadratic Programming category of zoning, graph-theoretical algorithms, dynamic programming, retroactive search, the partition algorithm, branch-and-bound algorithm computer, most optimization theory of the three non-classical algorithm : simulated annealing, neural networks, genetic algorithms, mesh algorithms and exhaustive, some consecutive discrete method, numerical analysis algorithms, image processing algorithm) Platform: |
Size: 5928960 |
Author:zhxj |
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: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes Platform: |
Size: 3072 |
Author:郎风华 |
Hits:
Description: 利用分支定届算法实现线性混合整数规划模型的求解（MATLAB代码）- using branch algorithm to solve the mixed integer linear programming model (MATLAB code) Platform: |
Size: 8192 |
Author:Lizzer Wee |
Hits:
Description: 算法：用分支定界求最短路径,北航计算机学院算法课作业-Algorithm: get the shortest path using the branch and bound algorithm Platform: |
Size: 1595392 |
Author:柴巧珍 |
Hits:
Search - branch bound algorithm