搜索资源列表
dominate
- 用差分进化算法求解带有约束的混合整数规划问题-Using differential evolution algorithm for solving mixed integer programming with constraints problem
branchbound
- 高效线性整数规划求解matlab源程序，详细注释，完善测试-linear integer programming matlab source codes with detailed remarks and tests，
DividePlane
- 用割平面法求解整数规划。先不考虑整数约束条件，求松弛问题的最优解，如果获得整数最优解，即为所求，运算停止．如果所得到最优解不满足整数约束条件，则在此非整数解的基础上增加新的约束条件重新求解．-By cutting plane method for solving integer programming. Not considered integer constraints, the optimal solution relaxation problem, if the integer obtai
DividePlane
- DividePlane：用割平面法求解整数规划 -DividePlane: by cutting plane method for solving integer programming
mixed-integer-programming-problem
- 处理混合整数规划问题,可以方便计算整数规划问题-Handle mixed integer programming problem
BNBGUI
- 分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
zhengshuguihua
- 用于求解整数规划的matlab程序，有实例，通用性较强，可改动-For solving integer programming matlab program, there are examples of highly versatile, can be altered
zhengshuguihua
- 最优化问题中的整数规划问题，最优解需要是整数-Optimization problem of integer programming problems, the optimal solution requires an integer
Gomory
- 用割平面法求解整数规划mat源程序，这个方法可以运行，用割平面法求解整数规划mat源程序，这个方法可以运行-By cutting plane method for solving integer programming mat source, this method can be run by solving integer programming source mat cutting plane method, this method can be run
BNBGUI
- 分支定界算法的GUI版用来解整数规划问题相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
BendersDecomposition
- 用benders分解法求解0-1整数规划问题-0-1 integer programming problem using benders decomposition method
zuiyouhua
- 求解约束优化，非线性最小二乘优化，线性优化，整数规划，二次规划等最优化问题-Solving constrained optimization, nonlinear least squares optimization, linear optimization, integer programming, quadratic programming and other optimization problems
L01
- 隐枚举法求解01整数规划问题，约束线性，目标函数线性-01 implicit enumeration method for solving integer programming problems, constraints linear, linear objective function
0-1matlab
- 穷举法求解0-1整数规划的matlab程序-0-1 LP based on matlab
data
- 隐枚举法解整数规划，一开始先进行变量个数判断，小于三则直接遍历。-Implicit enumeration method for solving integer programming, beginning first performed to determine the number of variables, less than three directly traversal.
fenzhidingjiefa
- 分支定界法能够用在处理整数规划问题中，是一种很经典的方法。希望大家有用！-Branch and bound method
linear-programming-algorithm
- 线性规划算法，整数规划及二次规划算法，经测试收敛较快，效果不错，需要非线性最优化的可以借鉴-Linear programming algorithm, integer programming, quadratic programming algorithm, tested converges faster, effect is good, need to nonlinear optimization can draw lessons from
evacuation
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网-very goog
lp_solve_5.1_MATLAB_exe
- 运用分枝定界法求解混合整数规划的matlab程序- Use the branch and bound method for solving mixed integer programming procedures -Use the branch and bound method for solving mixed integer programming procedures
PlanProblem
- 线性规划： CmpSimpleMthd(完整单纯形法) 整数规划(含0-1规划) DividePlane(割平面法) ZeroOneprog(枚举法) 二次规划 QuadLagR(拉格朗日法) ActivedeSet(起作用集法)-Linear Programming: CmpSimpleMthd (complete simplex method) Integer programming (including 0-1 Programming) Divide