Results 251 to 260 of about 189,838 (273)
Some of the next articles are maybe not open access.
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
Cutting-plane method based on epigraph approximation with discarding the cutting planes
Automation and Remote Control, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zabotin I., Yarullin R.
openaire +4 more sources
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.
openaire +1 more source
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.
openaire +1 more source
Fenchel Cutting Planes for Integer Programs
Operations Research, 1994A technique for generating cutting planes for integer programs is introduced that is based on the ability to optimize a linear function on a polyhedron rather than explicit knowledge of the underlying polyhedral structure of the integer program. The theoretical properties of the cuts and their relationship to Lagrangian relaxation are discussed, the ...
openaire +2 more sources
Mathematical Programming, 2003
The T-space [\textit{R. E. Gomory}, Some polyhedra related to combinatorial problems. Combinat. Struct. Appl., Proc. Calgary internat. Conf. combinat. Struct. Appl., Calgary 1969), 117 (1970; Zbl 0245.90019)] associated to an integer programming problem IP is the ambient space of integer coefficients of group elements of the group relaxation of IP.
Gomory, Ralph E., Johnson, Ellis L.
openaire +1 more source
The T-space [\textit{R. E. Gomory}, Some polyhedra related to combinatorial problems. Combinat. Struct. Appl., Proc. Calgary internat. Conf. combinat. Struct. Appl., Calgary 1969), 117 (1970; Zbl 0245.90019)] associated to an integer programming problem IP is the ambient space of integer coefficients of group elements of the group relaxation of IP.
Gomory, Ralph E., Johnson, Ellis L.
openaire +1 more source
Cutting Planes from Wide Split Disjunctions
2017In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first time though, we present applications and computational results.
Bonami P. +3 more
openaire +2 more sources
Cancelling cuts in the regge plane
Physics Letters, 1963The application of the unitary condition in crossed channels suggests the possibility of cuts in the Regge plane. An example from perturbation theory is given in which cancellations between separate terms in the unitary sum removes unwelcome singularities. (C.E.S.)
openaire +1 more source