The split closure of a strictly convex body
From MaRDI portal
Publication:2275578
DOI10.1016/j.orl.2011.02.002zbMath1225.90085OpenAlexW2117556452MaRDI QIDQ2275578
Santanu S. Dey, Juan Pablo Vielma, Daniel Dadush
Publication date: 9 August 2011
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.02.002
Related Items
Convex hull of two quadratic or a conic quadratic and a quadratic inequality ⋮ On sublinear inequalities for mixed integer conic programs ⋮ A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization ⋮ On the polyhedrality of cross and quadrilateral closures ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Two-term disjunctions on the second-order cone ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ On families of quadratic surfaces having fixed intersections with two hyperplanes ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Split Cuts in the Plane ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization ⋮ Some cut-generating functions for second-order conic sets ⋮ Intersection cuts for convex mixed integer programs from translated cones ⋮ Semi-continuous network flow problems ⋮ On valid inequalities for mixed integer \(p\)-order cone programming ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ The split closure of a strictly convex body ⋮ Split cuts and extended formulations for mixed integer conic quadratic programming ⋮ Disjunctive cuts for cross-sections of the second-order cone ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ On pathological disjunctions and redundant disjunctive conic cuts ⋮ A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
Uses Software
Cites Work
- Unnamed Item
- Lifting for conic mixed-integer programming
- MIR closures of polyhedral sets
- Chvátal closures for mixed integer programming problems
- Split closure and intersection cuts
- The split closure of a strictly convex body
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- A constructive characterization of the split closure of a mixed integer linear program
- Lectures on Modern Convex Optimization
- Mixed Integer Programming Computation
- 50 Years of Integer Programming 1958-2008
- Disjunctive Programming
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
