Split cuts and extended formulations for mixed integer conic quadratic programming

DOI10.1016/j.orl.2014.10.006zbMath1408.90201OpenAlexW2098304414MaRDI QIDQ1785310

Mustafa R. Kılınç, Juan Pablo Vielma, Sina Modaresi

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/113216

zbMATH Keywords

split cutconic MIRmixed integer conic quadratic programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items

Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Maximal Quadratic-Free Sets, A disjunctive cut strengthening technique for convex MINLP, On sublinear inequalities for mixed integer conic programs, 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, Lift-and-project cuts for convex mixed integer nonlinear programs, On the facet defining inequalities of the mixed-integer bilinear covering set, Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs, A framework for solving mixed-integer semidefinite programs, Cutting planes from extended LP formulations, How to convexify the intersection of a second order cone and a nonconvex quadratic, Supermodular covering knapsack polytope, A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization, Some cut-generating functions for second-order conic sets, Mixed integer programming with a class of nonlinear convex constraints, Intersection cuts for convex mixed integer programs from translated cones, Disjunctive cuts for cross-sections of the second-order cone, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Strong formulations for conic quadratic optimization with indicator variables, On the implementation and strengthening of intersection cuts for QCQPs, On pathological disjunctions and redundant disjunctive conic cuts, On the implementation and strengthening of intersection cuts for QCQPs, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Maximal quadratic-free sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective branch-and-bound algorithm for convex quadratic integer programming
• MIR closures of polyhedral sets
• Conic mixed-integer rounding cuts
• Chvátal closures for mixed integer programming problems
• Disjunctive programming: Properties of the convex hull of feasible points
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• A branch-and-cut method for 0-1 mixed convex programming
• The split closure of a strictly convex body
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• Some polyhedra related to combinatorial problems
• Cuts for mixed 0-1 conic programming
• A constructive characterization of the split closure of a mixed integer linear program
• On Minimal Valid Inequalities for Mixed Integer Conic Programs
• Lift-and-Project Cuts for Mixed Integer Convex Programs
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
• A Strong Dual for Conic Mixed-Integer Programs
• Intersection Cuts for Mixed Integer Conic Quadratic Sets
• On the rank of mixed 0,1 polyhedra.
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets