Two-term disjunctions on the second-order cone (Q896297): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic mixed-integer rounding cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting for conic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Cuts for Nonconvex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of quadratic surfaces having fixed intersections with two hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-Project Cuts for Mixed Integer Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes from two-term disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to convexify the intersection of a second order cone and a nonconvex quadratic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MILP Road to MIQCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing deep facet-defining disjunctive cuts for mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex-analysis perspective on disjunctive cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The split closure of a strictly convex body / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3394516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-planes for weakly-coupled 0/1 second order cone programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-project cuts for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimal Valid Inequalities for Mixed Integer Conic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Term Disjunctions on the Second-Order Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split cuts and extended formulations for mixed integer conic quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive cuts for cross-sections of the second-order cone / rank
 
Normal rank

Latest revision as of 04:08, 11 July 2024

scientific article
Language Label Description Also known as
English
Two-term disjunctions on the second-order cone
scientific article

    Statements

    Two-term disjunctions on the second-order cone (English)
    0 references
    0 references
    0 references
    9 December 2015
    0 references
    mixed-integer conic programming
    0 references
    second-order cone programming
    0 references
    cutting planes
    0 references
    disjunctive cuts
    0 references
    0 references
    0 references
    0 references

    Identifiers