搜索资源列表
branch_bound
- 改程序为用C语言编写的运筹学分支定界法程序，欢迎大家下载纠错！-branch and bound
MCMProjects
- 我备战2010数学建模美赛所精心准备的算法资料，一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现，来解决一个问题。其中一些是自己编写，其它的也是由网上找到后经过修改编译通过的。比赛结果还不错，一个M，现在把资料共享出来，希望对大家有所帮助，算法主要有模拟退火，遗传算法，蒙特卡罗算法，蚁群算法，粒子群算法，元胞自动机，Dijkstra，最小生成树算法，二分图最大匹配算法，最大流算法，动态规划算法，分支定界法，排队论算法，决策论算法等，我写了个说明文件，列的挺详细的-I a
somealgorithm
- 描述了分支定界算法，贪婪算法，动态规划算法，分而治之算法，回溯算法，理论性很强-Describe the branch and bound algorithm, greedy algorithms, dynamic programming algorithm, divide and conquer algorithms, backtracking algorithms, highly theoretical
knapbranch
- 0-1背包问题的分支定界算法实现。包含优先队列的实现细节。-0-1 knapsack problem branch and bound algorithm. Priority queue that contains the implementation details.
hamilton
- 分支定界法解旅行商问题的简单实现，用C++代码，效率经过优化后可以在1s内解规模为25左右的旅行商问题。附带了测试文件的自动生成工具。-Branch and bound method for solving the traveling salesman problem is simple to achieve, with the C++ code, the efficiency can be optimized through the solution 1s about the size of
2-22
- 分支定界法实现旅行商问题，分支定界法是算法里非常重要的一个方法-Branch and bound method to achieve the traveling salesman problem, branch and bound algorithm is a very important way in
the-branch-and-bound-algorithm
- 算法：用分支定界求最短路径,北航计算机学院算法课作业-Algorithm: get the shortest path using the branch and bound algorithm
IntProgFZ1
- matlab利用分支定界法求解整数规划的m函数文件，有详细的输入说明-matlab using the branch and bound method for solving integer programming m-function file, a detailed descr iption of the input
DPAlgo
- 用分支定界算法求解一个点到点最短路径问题，并有最大开销限制。所用的数据矩阵很大，可以用来研究分支限界和动态规划。-Branch and bound algorithm for a point to point shortest path problem, and the maximum spending limits. The data matrix can be used to study branch and bound and dynamic programming.
ip
- 分支定界法、割平面法、隐式枚举法的整数规划matlab源代码-The branch and bound method for, cut plane method, the method of implicit enumeration methods of integer programming matlab source code
005
- 该算法是分支定界法的应用源码，也是解决旅行售货员问题的计算代码。-in this programming,we give the Branch and bound method of application source code.if you want to solve the Traveling Salesman Problem,it may help you.
BranchBound
- branchbound就是所谓的分支定界算法，应用于动态规划解决实际问题-branchbound is called the branch and bound algorithm applied to the dynamic programming to solve practical problems
BBExample
- 本文件主要是关于分支定界算法的MATLAB程序，采用分支定界法来求取线性规划与非线性规划等问题的全局最优解。-This document is a MATLAB program on the branch and bound algorithm using the branch and bound method to strike a global optimal solution of linear programming and nonlinear programming problems.
MIP
- 运用分枝定界法求解混合整数规划程序 各输入参数的含义： min f*x A*x<=b Aeq*x=beq iter_num_max:迭代次数的上限 lb:各变量的下限 ub:各变量的上限 x0:初值 ID:0、1变量，ID(k)=1,表示第k个变量为整数变量，ID(k)=0，表示第k个变量为非整数变量 ftemp_up:初始上界,无法找到初始上界，默认为无穷大 IP：初始可行解，无法找到初始可行解，默认为空 各输出参
branch
- 关于基因序列上的比对问题 运用的方法是分支定界法 同时有贪婪算法作以比较-On the sequence alignment problem on the use of branch and bound method is a greedy algorithm for the same time to compare
fenzhidingjie
- 本程序用C语言编写实现，程序源代码文件为“分支定界实现源程序.c” ，在windows XP下用VC++6.0上编译运行通过，生成可执行文件“分支定界实现程序.exe” 。运行程序时，请将题目中所给的文件“m1.txt” 和“m2.txt”与可执行文件“分支定界实现程序.exe”放在同一个文件夹下，然后双击打开“分支定界实现程序.exe”即可运行程序。-The program using the C language implementation, program source code fil
0_1beibao
- 0_1背包问题的分支定界法算法 希望帮到大家-0_1 branch and bound method for the knapsack problem algorithm
BAB
- 使用分支定界法进行特征选择，是基于单调准则函数进行优化搜索的一种方法。-Feature selection using the branch and bound method, a method based on a monotonic criterion function to optimize the search.
minPath
- 这是一道算法作业题目，解决一个分支定界问题，求最短路径问题-This is an algorithm assignment questions to resolve a branch and bound for the shortest path problem
zhengshuguihua
- 整数规划：用割平面法求解整数规划 用分支定界法求解整数规划 用枚举法（包括穷举法和隐枚举法）求解0－1规划 -Integer programming: cutting plane method for solving integer programming with branch and bound method for solving integer programming Solving 0-1 planning enumeration method (exhaustive me