Split cuts and extended formulations for mixed integer conic quadratic programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- A constructive characterization of the split closure of a mixed integer linear program
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A strong dual for conic mixed-integer programs
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Chvátal closures for mixed integer programming problems
- Conic mixed-integer rounding cuts
- Cuts for mixed 0-1 conic programming
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Disjunctive programming: Properties of the convex hull of feasible points
- Intersection cuts for mixed integer conic quadratic sets
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Lift-and-project cuts for mixed integer convex programs
- MIR closures of polyhedral sets
- Mixed integer second order cone programming.
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- On minimal valid inequalities for mixed integer conic programs
- On the rank of mixed 0,1 polyhedra.
- Some polyhedra related to combinatorial problems
- The split closure of a strictly convex body
Cited in
(30)- A framework for solving mixed-integer semidefinite programs
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Maximal quadratic-free sets
- Maximal quadratic-free sets
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
- Intersection cuts for convex mixed integer programs from translated cones
- Some cut-generating functions for second-order conic sets
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- On sublinear inequalities for mixed integer conic programs
- On t-branch split cuts for mixed-integer programs
- Strong formulations for conic quadratic optimization with indicator variables
- A disjunctive cut strengthening technique for convex MINLP
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Extended formulations in mixed-integer convex programming
- Two-term disjunctions on the second-order cone
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Disjunctive cuts in mixed-integer conic optimization
- Mixed integer programming with a class of nonlinear convex constraints
- On the implementation and strengthening of intersection cuts for QCQPs
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Disjunctive cuts for cross-sections of the second-order cone
- Cutting planes from extended LP formulations
- Supermodular covering knapsack polytope
- On the implementation and strengthening of intersection cuts for QCQPs
- On pathological disjunctions and redundant disjunctive conic cuts
- Extended formulations in mixed integer conic quadratic programming
This page was built for publication: Split cuts and extended formulations for mixed integer conic quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785310)
