On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815): 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: Inequalities from Two Rows of a Simplex Tableau / 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: A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems / 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: Integer programming and convex analysis: Intersection cuts from outer polars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Sets and Minimal Sublinear Functions / 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: Mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / 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: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / 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: An algorithmic framework for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Valid Inequalities for Integer Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective branch-and-bound algorithm for convex quadratic integer programming / 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: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between intersection cuts and the corner polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-Generating Functions and <i>S</i>-Free Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of mixed integer programs with two integer variables and two constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficiency of cut-generating functions / 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: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality Constrained Linear-Quadratic Optimal Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15--17, 2011. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LMI description for the cone of Lorentz-positive maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LMI description for the cone of Lorentz-positive maps II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal inequalities / 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: Two-Term Disjunctions on the Second-Order Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio optimization with linear and fixed transaction costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Dual for Conic Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification Techniques for Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse learning via Boolean relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs / 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: Clustering via minimum volume ellipsoids / 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: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-Generating Functions for Integer Variables / 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 01:01, 12 July 2024

scientific article
Language Label Description Also known as
English
On Minimal Valid Inequalities for Mixed Integer Conic Programs
scientific article

    Statements

    On Minimal Valid Inequalities for Mixed Integer Conic Programs (English)
    0 references
    19 May 2016
    0 references
    minimal inequalities
    0 references
    mixed integer conic programming
    0 references
    disjunctive programming
    0 references
    cutting planes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references