Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

From MaRDI portal
Publication:5962729

DOI10.1007/s10107-015-0866-5zbMath1358.90078arXiv1302.2556OpenAlexW2029715007MaRDI QIDQ5962729

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

Publication date: 23 February 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2556



Related Items

Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Maximal Quadratic-Free Sets, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, 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, Strong formulations for quadratic optimization with M-matrices and indicator variables, 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, Lift-and-project cuts for convex mixed integer nonlinear programs, On the facet defining inequalities of the mixed-integer bilinear covering set, Submodularity in Conic Quadratic Mixed 0–1 Optimization, 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, Intersection cuts for convex mixed integer programs from translated cones, Split cuts and extended formulations for mixed integer conic quadratic programming, Strong formulations for conic quadratic optimization with indicator variables, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Ideal formulations for constrained convex optimization problems with indicator variables, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets


Uses Software


Cites Work