搜索资源列表
MATLAB
- MATLAB分支定界法求解,大家
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
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
IntProgFZ.rar
- 利用分支定界法求解整数规划问题，结果精确~~~~~,Using branch and bound method to solve integer programming problems, the results of precise ~~~~~
branch-and-cut-algorithm.rar
- 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。 ,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
MIP
- 运用分支定界法求解混合整数线性规划，可用于求解电力系统机组组合问题- solving mixed integer linear programming branch and bound method ,and the program can solve unit commitment problem
fenzhijianding
- 实验目的：用Matlab实现分支定界法求解整数线性规划问题。 实验内容： 用分支定界法求下面的线性整数规划问题的最优解： -Experiment Objective: Matlab to achieve branch and bound method for solving integer linear programming problem. Experiment content: With the branch and bound method seek
linearoptimization
- 分支定界法解整数线性规划问题，在matlab 的环境下使用-linear optimization
branch_bound
- 改程序为用C语言编写的运筹学分支定界法程序，欢迎大家下载纠错！-branch and bound
MCMProjects
- 我备战2010数学建模美赛所精心准备的算法资料，一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现，来解决一个问题。其中一些是自己编写，其它的也是由网上找到后经过修改编译通过的。比赛结果还不错，一个M，现在把资料共享出来，希望对大家有所帮助，算法主要有模拟退火，遗传算法，蒙特卡罗算法，蚁群算法，粒子群算法，元胞自动机，Dijkstra，最小生成树算法，二分图最大匹配算法，最大流算法，动态规划算法，分支定界法，排队论算法，决策论算法等，我写了个说明文件，列的挺详细的-I a
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
IntProgFZ1
- matlab利用分支定界法求解整数规划的m函数文件，有详细的输入说明-matlab using the branch and bound method for solving integer programming m-function file, a detailed descr iption of the input
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.
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.
branch
- 关于基因序列上的比对问题 运用的方法是分支定界法 同时有贪婪算法作以比较-On the sequence alignment problem on the use of branch and bound method is a greedy algorithm for the same time to compare
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.
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