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: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes Platform: |
Size: 3072 |
Author:郎风华 |
Hits:
Description: 搜索算法——包含回溯法、分枝定界和贪心法-Search algorithm- includes backtracking, branch and bound and the greedy method Platform: |
Size: 6144 |
Author:chen |
Hits:
Description: 0-1背包问题的分支限界算法实现,有详细的函数功能说明
-0-1 knapsack problem branch and bound algorithm, a detailed description of the function function Platform: |
Size: 2048 |
Author:古月 |
Hits:
Description: 分支-切割法是把分支定界法与割平面法结合起来,用来求解混合整数规划问题。-Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is a hybrid of branch and bound and cutting plane methods. Platform: |
Size: 1384448 |
Author:abrahamlau |
Hits:
Description: 算法:用分支定界求最短路径,北航计算机学院算法课作业-Algorithm: get the shortest path using the branch and bound algorithm Platform: |
Size: 1595392 |
Author:柴巧珍 |
Hits: