Two-Term Disjunctions on the Second-Order Cone

DOI10.1007/978-3-319-07557-0_29zbMath1418.90178OpenAlexW2134251449MaRDI QIDQ5419008

Fatma Kılınç-Karzan, Sercan Yıldız

Publication date: 2 June 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_29

zbMATH Keywords

cutting planessecond-order cone programmingmixed integer conic programmingdisjunctive cuts

Mathematics Subject Classification ID

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

Related Items (10)

On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ On sublinear inequalities for mixed integer conic programs ⋮ SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs ⋮ Two-term disjunctions on the second-order cone ⋮ 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 ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ On pathological disjunctions and redundant disjunctive conic cuts ⋮ Ideal formulations for constrained convex optimization problems with indicator variables

This page was built for publication: Two-Term Disjunctions on the Second-Order Cone