Intersection Cuts for Mixed Integer Conic Quadratic Sets

DOI10.1007/978-3-642-36694-9_4zbMath1346.90623OpenAlexW35597285MaRDI QIDQ4910803

Kent Andersen, Anders Nedergaard Jensen

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_4

Mathematics Subject Classification ID

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

Related Items (25)

Convex hull of two quadratic or a conic quadratic and a quadratic inequality ⋮ Maximal Quadratic-Free Sets ⋮ On sublinear inequalities for mixed integer conic programs ⋮ Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ Towards a characterization of maximal quadratic-free sets ⋮ Two-term disjunctions on the second-order cone ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ 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 ⋮ Mixed integer programming with a class of nonlinear convex constraints ⋮ Intersection cuts for convex mixed integer programs from translated cones ⋮ 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 ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ On pathological disjunctions and redundant disjunctive conic cuts ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On a generalization of the Chvátal-Gomory closure ⋮ Maximal quadratic-free sets

Uses Software

• SINGULAR

This page was built for publication: Intersection Cuts for Mixed Integer Conic Quadratic Sets