Cutting-plane method

Known as: Gomory cut, Cutting plane, Gomory cuts 
In mathematical optimization, the cutting-plane method is an umbrella term for optimization methods which iteratively refine a feasible set or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2017
0204019692017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades, and its rate of… (More)
  • figure 2
  • figure 5
Is this relevant?
2010
2010
For thirty years after their invention half a century ago, cutting planes for integer programs have been an object of theoretical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Discriminative training approaches like structural SVMs have shown much promise for building highly complex and accurate models… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
Semideenite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described… (More)
Is this relevant?
2007
2007
4 Some specific cutting-plane methods 12 4.1 Bisection method on R . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be… (More)
Is this relevant?
2001
2001
We present an iterative algorithm for solving variational inequalities under the weakest monotonicity condition proposed so far… (More)
  • figure 2
Is this relevant?
1999
1999
We present a cutting plane algorithm for the feasibility problem that uses a homogenized self-dual approach to regain an… (More)
  • table 1.1
  • table 1.1
  • table 1.2
Is this relevant?
1998
1998
One of the major computational tasks of using the traditional cutting plane approach to solve linear semi-in nite programming… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound for… (More)
Is this relevant?