Results 281 to 290 of about 2,078,237 (349)
Some of the next articles are maybe not open access.

Cutting Plane Proofs

2011
We now turn our attention to a proof system more powerful than resolution—the so-called cutting plane proof system. This proof system, which can be viewed as a “geometric generalization” of resolution, originated in works on integer programming by Gomory (1963) and Chvatal (1973); as a proof system it was first considered in Cook et al.
S. Jukna
openaire   +2 more sources

Consistent tangent operator for cutting-plane algorithm of elasto-plasticity

Computer Methods in Applied Mechanics and Engineering, 2014
Bojan Starman   +2 more
exaly   +2 more sources

Coordinated cutting plane generation via multi-objective separation [PDF]

open access: yesMathematical programming, 2012
In cutting plane methods, the question of how to generate the best possible set of cuts is both central and crucial. We propose a lexicographic multi-objective cutting plane generation scheme that generates, among all the maximally violated valid ...
E. Amaldi   +2 more
semanticscholar   +5 more sources

Achieving consistency with cutting planes

Mathematical Programming, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Danial Davarnia   +2 more
openaire   +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

Theoretical challenges towards cutting-plane selection

Mathematical programming, 2018
While many classes of cutting-planes are at the disposal of integer programming solvers, our scientific understanding is far from complete with regards to cutting-plane selection, i.e., the task of selecting a portfolio of cutting-planes to be added to ...
Santanu S. Dey, M. Molinaro
semanticscholar   +1 more source

A cutting-plane method to nonsmooth multiobjective optimization problems

European Journal of Operational Research, 2019
The cutting-plane optimization methods rely on the idea that any subgradient of the objective function or the active/violated constraints defines a halfspace to be excluded from a set that contains an optimal solution: the localizing set.
D. Vieira, A. C. Lisboa
semanticscholar   +1 more source

Cutting Planes and the Parameter Cutwidth

Theory of Computing Systems, 2009
From the text: The system of Cutting Planes [\dots] provides a method for solving integer linear programs [\dots] by iteratively deriving further constraints until the problem is reduced to a general linear program (for which a polynomial algorithm is known). In terms of feasible solutions, this equates to isolating the integer hull of the solution set
Stefan S. Dantchev, Barnaby Martin
openaire   +2 more sources

Cutting-plane method based on epigraph approximation with discarding the cutting planes

Automation and Remote Control, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zabotin I., Yarullin R.
openaire   +4 more sources

Home - About - Disclaimer - Privacy