Strong formulations for quadratic optimization with M-matrices and indicator variables
- 25 May 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 170 (1) , 141-176
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Office of the Secretary of Defense (FA9550-10-1-0168)
This publication has 40 references indexed in Scilit:
- Network design with probabilistic capacitiesNetworks, 2017
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functionsMathematical Programming, 2016
- Best subset selection via a modern optimization lensThe Annals of Statistics, 2016
- On mathematical programming with indicator constraintsMathematical Programming, 2015
- Cutting-Planes for Optimization of Convex Functions over Nonconvex SetsSIAM Journal on Optimization, 2014
- On convex relaxations for quadratically constrained quadratic programmingMathematical Programming, 2012
- A strong conic quadratic reformulation for machine-job assignment with controllable processing timesOperations Research Letters, 2009
- A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow ProblemAlgorithmica, 2004
- Fast approximate energy minimization via graph cutsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985