Results 291 to 300 of about 191,202 (337)
Some of the next articles are maybe not open access.
1980
We give a geometrical description of Chvatal's version of Gomory's cutting plane method. Restricting ourselves to rational spaces, we prove that the derived geometrical objects are polyhedra again, and that the method also works for unbounded polyhedra.
Schrijver, A, Schrijver, A
openaire +2 more sources
We give a geometrical description of Chvatal's version of Gomory's cutting plane method. Restricting ourselves to rational spaces, we prove that the derived geometrical objects are polyhedra again, and that the method also works for unbounded polyhedra.
Schrijver, A, Schrijver, A
openaire +2 more sources
Proceedings of the 2008 C3S2E conference on - C3S2E '08, 2008
The interpretation of results of analysis often requires considerable resources; both hardware and human expertise and time. Many disciplines generate three-dimensional volume datasets that need to be explored to observe structure and trends in key variables.
openaire +1 more source
The interpretation of results of analysis often requires considerable resources; both hardware and human expertise and time. Many disciplines generate three-dimensional volume datasets that need to be explored to observe structure and trends in key variables.
openaire +1 more source
2000
In this chapter, we introduce a class of methods that were among the first to be designed for the solution of integer programming problems. Throughout the past decades, however, computational evidence has revealed that cutting planes, while appealing from a theoretical point of view, do not appear to work very well if applied to general integer ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
In this chapter, we introduce a class of methods that were among the first to be designed for the solution of integer programming problems. Throughout the past decades, however, computational evidence has revealed that cutting planes, while appealing from a theoretical point of view, do not appear to work very well if applied to general integer ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
Generalized Cutting Plane Algorithms
SIAM Journal on Control, 1971This paper introduces a master cutting plane algorithm for nonlinear programming that isolates the points it generates from one another until a solution is achieved. The master algorithm provides a foundation for the study of cutting plane algorithms and directs the way for development of procedures which permit deletion of old cuts.
B. Curtis Eaves, W. I. Zangwill
openaire +1 more source
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
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
Proceedings of the 22nd ACM Conference on Virtual Reality Software and Technology, 2016
Dense 3D reconstructions of real-world environments become wide spread and are foreseen to act as data base to solve real world problems, such as remote inspections. Therefore not only scene viewing is required but also the ability to interact with the environment, such as selection of a user-defined part of the reconstruction for later usage. However,
Annette Mossel, Christian Koessler
openaire +1 more source
Dense 3D reconstructions of real-world environments become wide spread and are foreseen to act as data base to solve real world problems, such as remote inspections. Therefore not only scene viewing is required but also the ability to interact with the environment, such as selection of a user-defined part of the reconstruction for later usage. However,
Annette Mossel, Christian Koessler
openaire +1 more source
2014
Subgradient methods described in the previous chapter use only one arbitrary subgradient (generalized gradient) at a time, without memory of past iterations. If the information from previous iterations is kept, it is possible to define a model—the so-called cutting plane model—of the objective function.
Adil Bagirov +2 more
openaire +1 more source
Subgradient methods described in the previous chapter use only one arbitrary subgradient (generalized gradient) at a time, without memory of past iterations. If the information from previous iterations is kept, it is possible to define a model—the so-called cutting plane model—of the objective function.
Adil Bagirov +2 more
openaire +1 more source
Cutting-Planes for Complementarity Constraints
SIAM Journal on Control and Optimization, 1978A characterization is given of all the cutting-planes for a generalized linear complementarity problem, in terms of rules whose repeated application yields exactly these valid implied inequalities.This report is a revision of our paper (1976), and our earlier proofs have been substantially simplified.
openaire +1 more source
Cutting Planes and the Parameter Cutwidth
Theory of Computing Systems, 2009From 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
Dantchev, Stefan, Martin, Barnaby
openaire +2 more sources
Solving Quadratic Programming by Cutting Planes
SIAM Journal on Optimization, 2019Summary: We propose new cutting planes for strengthening the linear relaxations that appear in the solution of nonconvex quadratic problems with linear constraints. By a famous result of Motzkin and Straus, these problems are connected to the clique number of a graph.
Bonami P. +3 more
openaire +2 more sources