Results 261 to 270 of about 2,777,990 (323)
Some of the next articles are maybe not open access.

Related searches:

Solving Quadratic Programming by Cutting Planes

SIAM Journal on Optimization, 2019
We propose new cutting planes for strengthening the linear relaxations that appear in the solution of nonconvex quadratic problems with linear constraints.
Andrea Lodi, Pierre Bonami
exaly   +5 more sources

Semantic Versus Syntactic Cutting Planes [PDF]

open access: yesSymposium on Theoretical Aspects of Computer Science, 2016
In this paper, we compare the strength of the semantic and syntactic version of the cutting planes proof system. First, we show that the lower bound technique of Pudlák applies also to semantic cutting planes: the proof system has feasible interpolation via monotone real circuits, which gives an exponential lower bound on lengths of semantic cutting ...
Yuval Filmus, P. Hrubes, Massimo Lauria
semanticscholar   +7 more sources

The space complexity of cutting planes refutations [PDF]

open access: yesElectron. Colloquium Comput. Complex., 2015
We study the space complexity of the cutting planes proof system, in which the lines in a proof are integral linear inequalities. We measure the space used by a refutation as the number of linear inequalities that need to be kept on a blackboard while ...
Nicola Galesi, P. Pudlák, Neil Thapen
semanticscholar   +2 more sources

Cutting planes and beyond

Computers & Graphics, 1997
We present extensions to the traditional cutting plane that become practical with the availability of virtual reality devices. These extensions take advantage of the intuitive ease of use associated with the cutting metaphor. Using their hands as the cutting tool, users interact directly with the data to generate arbitrarily oriented planar surfaces ...
Michael Clifton, Alex Pang
openaire   +1 more source

Home - About - Disclaimer - Privacy