On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
From MaRDI portal
Publication:4910814
DOI10.1007/978-3-642-36694-9_15zbMath1372.90073MaRDI QIDQ4910814
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_15
semidefinite programming; valid inequalities; perspective reformulation; mixed integer quadratic programming
90C22: Semidefinite programming
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C20: Quadratic programming
Related Items
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Strong formulations for quadratic optimization with M-matrices and indicator variables, Extended formulations in mixed integer conic quadratic programming, Quadratic cone cutting surfaces for quadratic programs with on-off constraints, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, Valid Inequalities for Separable Concave Constraints with Indicator Variables