Results 301 to 310 of about 191,202 (337)
Some of the next articles are maybe not open access.
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
A reticular chemistry guide for the design of periodic solids
Nature Reviews Materials, 2021Hao Jiang +2 more
exaly
Drug-tolerant persister cells in cancer: the cutting edges and future directions
Nature Reviews Clinical Oncology, 2023, , Dominique Heymann
exaly
The emerging role of photoacoustic imaging in clinical oncology
Nature Reviews Clinical Oncology, 2022Li Lin, Lihong V Wang
exaly