Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,229,818 papers from all fields of science
Search
Sign In
Create Free Account
Cutting-plane method
Known as:
Gomory cut
, Cutting plane
, Gomory cuts
Expand
In mathematical optimization, the cutting-plane method is an umbrella term for optimization methods which iteratively refine a feasible set or…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Benson's algorithm
Branch and bound
Branch and cut
Column generation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Optimized Online Rank Learning for Machine Translation
Taro Watanabe
North American Chapter of the Association for…
2012
Corpus ID: 2658566
We present an online learning algorithm for statistical machine translation (SMT) based on stochastic gradient descent (SGD…
Expand
2011
2011
Performance of Three Alternative Surfacing Processes on Black Spruce Wood and Their Effects on Water-Based Coating Adhesion
Julie Cool
,
R. Hernández
2011
Corpus ID: 55465258
Surface quality and water-based coating performance of samples prepared by oblique cutting, helical planing, and face milling…
Expand
2009
2009
Cutting Plane Methods for Global Optimization
Tuy Hoang
Encyclopedia of Optimization
2009
Corpus ID: 36635837
An exercise device of the weight lifting type wherein the force or load conventionally supplied by weights is effectively…
Expand
2007
2007
STUDY ON PHYSICAL SIMULATION OF FULL-SEAM MINING FOR A 20 m VERY THICK AND MEDIUM HARD SEAM BY SUB-LEVEL CAVING MINING WITH HIGH BOTTOM CUTTING HEIGHT
Rui-Rong Liu
2007
Corpus ID: 113110945
Based on the condition of No.6–1 coal seam of Suancigou Coal Mine,the caving characteristics of the top coal and rooft,he bulk…
Expand
1998
1998
"Thin" vs. "fat" visualization client
M. Jern
Proceedings. Computer Graphics International (Cat…
1998
Corpus ID: 8330676
The paper explains the advantage of using low-cost, configurable, data visualization components, which can be embedded and…
Expand
Highly Cited
1997
Highly Cited
1997
Implementation and Computational Results
N. Tönshoff
1997
Corpus ID: 117054657
In the literature (see, e.g. Bertsimas and Tsitsiklis [1994], Chvatal [1983] and Garfinkel and Nemhauser [1972]), a number of…
Expand
1982
1982
Single-station fault plane solutions
C. Langston
1982
Corpus ID: 130845407
abstract Fault plane solutions are derived from systematic trial-and-error (“grid”) testing of three-component body waveform data…
Expand
1975
1975
A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
M. Bazaraa
,
J. Goode
Operational Research
1975
Corpus ID: 45864946
This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality…
Expand
1973
1973
Applications of a general convergence theory for outer approximation algorithms
W. Hogan
Mathematical programming
1973
Corpus ID: 450890
Eaves and Zangwill [2] have developed a very general theory of the convergence of cutting plane algorithms. This theory is…
Expand
1970
1970
On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
David S. Rubin
Operational Research
1970
Corpus ID: 29211378
The convex hull of the feasible integer points to a given integer program is a convex polytope I. The feasible set obtained by…
Expand