Cutting-plane method
In mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are commonly used to find integer solutions to mixed integer linear programming (MILP) problems, as well as to solve general, not necessarily differentiable convex optimization problems. The use of cutting planes to solve MILP was introduced by Ralph E. Gomory.
known for
Bayesian networkBenson's algorithmBranch and boundBranch and cutCOIN-ORConvex optimizationCutting-planeCutting-plane methodsCutting planeCutting plane methodDeterministic global optimizationEllipsoid methodFICO XpressGNU Linear Programming KitGomory cutGomory cutsHypohamiltonian graphIn Pursuit of the Traveling SalesmanInteger programmingLinear programmingLinear programming relaxationList of algorithmsList of terms relating to algorithms and data structuresMINTOMartin GrötschelPolyhedral combinatoricsProof complexityPropositional proof systemRalph E. GomorySelmer M. JohnsonSimplex algorithmToniann PitassiTravelling salesman problemTypometry (archaeology)Václav Chvátal
Link from a Wikipage to another Wikipage
known for
primaryTopic
Cutting-plane method
In mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are commonly used to find integer solutions to mixed integer linear programming (MILP) problems, as well as to solve general, not necessarily differentiable convex optimization problems. The use of cutting planes to solve MILP was introduced by Ralph E. Gomory.
has abstract
Ein Schnittebenenverfahren (en ...... -and-Cut-Verfahren kombiniert.
@de
Em Pesquisa Operacional, o mét ...... introduzido por Ralph Gomory.
@pt
En matemática, y más en concre ...... en uno de los lados del plano.
@es
En mathématiques, et spécialem ...... par Gomory et Václav Chvátal.
@fr
In mathematical optimization, ...... n the respective dual problem.
@en
Алгоритм Го́мори — алгоритм, к ...... им математиком Ральфом Гомори.
@ru
在数学优化中，切割平面法是通过线性不等式对或目标函数进行迭代 ...... 迟列生成法按需生成这些变量等同于在对应的对偶问题上切割平面。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
994,187,853
Link from a Wikipage to another Wikipage
date
November 2019
@en
reason
An explanation would be intere ...... atement feel less opinionated.
@en
wikiPageUsesTemplate
hypernym
comment
Ein Schnittebenenverfahren (en ...... zzahlige Lösung gefunden wird.
@de
Em Pesquisa Operacional, o mét ...... introduzido por Ralph Gomory.
@pt
En matemática, y más en concre ...... ra la solución entera óptima .
@es
En mathématiques, et spécialem ...... par Gomory et Václav Chvátal.
@fr
In mathematical optimization, ...... introduced by Ralph E. Gomory.
@en
Алгоритм Го́мори — алгоритм, к ...... им математиком Ральфом Гомори.
@ru
在数学优化中，切割平面法是通过线性不等式对或目标函数进行迭代 ...... 非整数解对松弛不再可行。该过程不断重复，直到找到最优整数解。
@zh
label
Cutting-plane method
@en
Méthode des plans sécants
@fr
Método de planos de corte
@es
Método de planos de corte
@pt
Schnittebenenverfahren
@de
Алгоритм Гомори
@ru
切割平面法
@zh