搜索资源列表
分支限界法_单源最短路径
- 算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC + + prepared
分支限界法_批处理作业调度
- 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC + + prepared
分支与界法
- 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
货郎担分枝限界算法图形
- 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
翻译材料
- 外观模拟分支定界 分支定界 -appearance simulation branch delimitation of branch-and-bound branch d elimitation of branch-and-bound branch delimitation of branch-and-bound
mazh
- 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm descr iption, failed to materialize here is the realization of complete, and packaged as a category.
分支界限
- 用vc编写的解决计算机算法中的分支限界问题，非常经典的代码，请多多指教！-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
yy.rar
- 求用分支限界算法解决旅行商问题的源程序,#include <stdio.h> #include <stdlib.h> #include <math.h> #define TRUE (1) #define FALSE (0) #define MAX_CITIES (10) #define INFINITY (999) #define I INFINITY ,Seeking with branch and bound algorithm t
BNB18
- matlab数学建模工具箱，非线性整数规划模型求解分支定界迭代算法-matlab toolbox of mathematical modeling, nonlinear integer programming model of iterative algorithm branch and bound
fenzhidingjie
- 整数规划，分支定界法，实现1000变量（变量个数可自行设定），只需改变原始数据，就能运行！是比较好的分支分支定界法程序设计-Integer programming, branch and bound method to achieve the 1000 variables (number of variables can be set on their own), simply by changing the original data, you can run! Branch is a bet
zuidatuan.rar
- 使用优先队列分支限界法对单源最短路径问题求解，最小堆作为优先队列的存储结构 使用最小堆来存储活结点，解空间树是一个子集树,Priority queue using branch and bound method of single-source shortest path problem solving, and the youngest heap as a priority queue to use the smallest heap storage structure to store s
intprog
- 分枝定界法程序，解混合整数线性规划《详解MATLAB在最优化计算中的应用》中的分枝定界法程序，稍作了修改-Branch and bound method procedures, the solution mixed integer linear programming, " Detailed MATLAB optimization calculation in the application" in the branch and bound procedure, slightl
duanyuanzuiduan.rar
- 单源最短路径问题，分支限界法的优先队列解法，最小堆来存储活结点表，表示活结点优先队列，优先级是结点所对应的当前路长,Single-source shortest path problem, branch and bound method of the priority queue method, the smallest heap to store slipknot points table, said slipknot point priority queue, priority is the
Qkw_Fac6_8.rar
- 电路板排列问题的分支限界解法,,本程序取自王晓东编著“算法分析与设计”第 225 页，原程序不通，我调试已通过。 ,Circuit board with the issue of branch and bound method, this procedure from Xiaodong edited Algorithm Analysis and Design section 225, the original procedures for access, I have passed deb
DividePlane
- 运筹学中的分支定界法，采用MATLAB编程，比较实用-Operations research branch and bound method, using MATLAB programming, more practical
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
geosteiner-3.1.tar
- A classic Steiner tree constructor based on branch-and-bound with the most close-to-optimum solution quality
n_queen
- 还是用分支限界法解N皇后问题，已成功运行过。-Using branch and bound Solving N Queens, which has been run successfully over
MIP
- 运用分支定界法求解混合整数线性规划，可用于求解电力系统机组组合问题- solving mixed integer linear programming branch and bound method ,and the program can solve unit commitment problem