1) Gomory cutting plane method
Gomory割平面法
1.
The experimental result show that they are better than the Gomory cutting plane method on the average.
结果表明：总体而言，它们都优于Gomory割平面法。
2) cutting plane method
割平面法
1.
Moreover,a cutting plane method of interactive linear multiple object decision which is more practical for decision process is used to solve the model.
利用更接近于实际决策过程的交互式线性多目标决策的割平面法对模型求解 ,给出了计算实例与分析 。
2.
The experimental result show that they are better than the Gomory cutting plane method on the average.
结果表明：总体而言，它们都优于Gomory割平面法。
3.
In the paper gives a way for a kind of acceleration getting the solution, by the appropriatetransformation to the gomory condition of cutting plane method that solved integral linear program-ming problem.
通过对解整数规划问题的割平面法中Gomory约束适当交换,给出一种加速获解的办法。
3) Gomory-Hu algorithm
Gomory-Hu算法
1.
Fast image segmentation based on Gomory-Hu algorithm;
基于图论Gomory-Hu算法的快速图像分割
2.
Effective implementation of image region segmentation based on Gomory-Hu algorithm;
基于Gomory-Hu算法有效实现的图像区域分割
3.
A novel method for SAR image segmentation based on Gomory-Hu algorithm is proposed in this paper.
该算法通过构造多尺度结构快速找到收缩图以及初始图的子图集合,然后对其分别应用Gomory-Hu算法得到对应的等价树,最后根据规则得到初始图的等价树,按照割值由小到大依次去边后,可得到对原图的最优划分,映射回图像则可得分割结果。
4) cutting plan method
切割平面法
1.
By means of the Max min method based on optimal fuzzy decision making,the problem is transformed into an ordinary single objective programming,and the optimal solution is obtained with the help of cutting plan method in Geometric Programming.
为使工程结构中多目标模糊优化设计问题得到合理而有效的解决，通过构造满足模糊约束条件的各模糊目标子集的隶属函数，用最优模糊判决协调求解的最大最小法，将多目标模糊优化设计化成普通单目标数学规划问题，并用几何规划的切割平面法来求解之。
5) double cutting plane method
双割平面法
6) cutting plane method
割平面方法
1.
This paper presents a branch and bound algorithm mixed with cutting plane technique for solving the concave quadratic programming problem by combining the cutting plane method with the branch and bound method,and proves that the algorithm is convergent.
把割平面方法融于分支定界方法之中,本文提出了求解凹二次规划问题的一个融合割平面方法的分支定界混合算法,证明了该算法是收敛的。
2.
In cutting plane method used in resolving ILP,there is an acknowledged problem,which is the problem of astringency to optimal solution.
本文根据对偶单纯形方法解题的基本思路,提出了割平面方法应用中选取割平面方程的优选准则,因而为解决该方法应用中一直没有解决的收敛性问题提供一种有效手段。
补充资料：法平面
法平面
normal plane
法平面【‘加因内理;”叩M助I.H四n邢c劝cT‘]，空间曲线在点M处的 通过点M且垂直于M处的切线(扭哈烈)的平面.法平面包含曲线的过点M的一切法线(nor-lml).如果在直角坐标中曲线由方程 x=f(t)，y=g(t)，z=h(t)给出，则在对应于参数t的值t。的点M(x。，y。，z。)处的法平面的方程可以写成下列形式: _、df(t。).，、dg(t。) (x一x。)一升汁匕二+(y一y。)=贵招二+ dt、JJ“产dt dh(t。) +(z一z。)二二2卫业上=0. dt如果曲线的方程具有形式r三r(t)，则法平面的方程是 ，~、dr (R一r、.共二=0. 一产dt EC3一3
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条