搜索资源列表
DividePlane.rar
- 利用割平面法求解整数规划，能够达到很好的效果~~~~,The use of cutting plane method for solving integer programming, to achieve good results ~ ~ ~ ~
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
planeWidgetCut
- 用VC和VTK实现，对于三维重建后头颅模型进行虚拟切割，三维重建采用体绘制技术，程序实现了任意的平面切割-VTK with VC and the realization of three-dimensional reconstruction of the skull model after virtual cutting, three-dimensional reconstruction using volume rendering techniques, and procedures to a
clip
- 使用OpenGL渲染了一个线框球体,并用两个裁剪平面切掉原球体的四分之三-The use of OpenGL rendering a wireframe sphere, and two cutting-plane cut off three-quarters of the original sphere
tieren
- VIJOS中铁人三项一题。 本程序使用二维线性规划方法来求解。 二维线性规划，本程序使用了切割半平面的有效算法，比单纯形法在二维上快。 程序对所有数据均秒闪。-Triathlon VIJOS in a title. This procedure using the two-dimensional approach to solving linear programming. Two-dimensional linear programming, the procedure used
MATLABoptimization
- matlab最优化程序包括 无约束一维极值问题 进退法 黄金分割法 斐波那契法 牛顿法基本牛顿法 全局牛顿法 割线法 抛物线法 三次插值法 可接受搜索法 Goidstein法 Wolfe.Powell法 单纯形搜索法 Powell法 最速下降法 共轭梯度法 牛顿法 修正牛顿法 拟牛顿法 信赖域法 显式最速下降法， Rosen梯度投影法 罚函数法 外点罚函数法 內点罚函数法 混合罚函数法 乘子法 G－N法 修正G－N法 L－M法
685
- Computational study of a cutting plane algorithm for University Course Timetabling
youhua
- 最优化方法及其Matlab程序设计。包括带约束的罚函数法，复合形法，坐标轮换法，乘子法，单纯形法，割平面法，粒子群法，遗传算法等各种优化算法-Optimization method and Matlab programming. Including the penalty function method with constraints, the complex method, coordinate rotation method, the multiplier method, the simp
gomory
- 割平面在MATLAB里的程序，很好用，希望和大家分享-Cutting plane in the MATLAB program, useful, and would like to share
DividePlane
- 最经典的Gomory割平面法求解整数规划问题-The most classic Gomory cutting plane method for solving integer programming problems
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
cutting-plane-method
- matlab使用割平面法求解线性规划问题，包含完整实验报告-matlab using cutting plane method for solving linear programming problems, including complete test report
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
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
umat42v
- mises屈服准则 和 切割平面方法 以及应力更新-mises yield criterion and cutting plane methods, and stress update
dePingMian
- 人体三维数据精简方法，运用平面切割的方法，即先平面切割，再留值-Human dimensional data reduction methods, the use of cutting plane methods, that is, first cutting plane, then leave the value
PlanProblem
- 线性规划： CmpSimpleMthd(完整单纯形法) 整数规划(含0-1规划) DividePlane(割平面法) ZeroOneprog(枚举法) 二次规划 QuadLagR(拉格朗日法) ActivedeSet(起作用集法)-Linear Programming: CmpSimpleMthd (complete simplex method) Integer programming (including 0-1 Programming) Divide
cutting-plane
- cutting plane in matlab for special example.
DividePlane
- 整数规划问题中，割平面法，这是最经典的Gomory割平面法-Integer programming problem, the cutting plane method, this is the most classic Gomory cutting plane method