Quadratic Optimization with Switching Variables: The Convex Hull for $n = 2$

Matrix Analysis

R. Horn and C. Johnson · 1985

Earlier work this paper cites.

A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

H. D. Sherali and W. P. Adams · 1997

Earlier work this paper cites.

Perspective cuts for a class of convex 0-1 mixed integer programs

A. Frangioni and C. Gentile · 2006

Earlier work this paper cites.

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

M. S. Aktürk, A. Atamtürk, and S. Gürel · 2009

Earlier work this paper cites.

On the copositive representation of binary and continuous nonconvex quadratic programs

S. Burer · 2009

Earlier work this paper cites.

On non-convex quadratic programming with box constraints

S. Burer and A. N. Letchford · 2009

Cited alongside, same era.

Computable representations for convex hulls of low-dimensional quadratic forms

K. M. Anstreicher and S. Burer · 2010

Cited alongside, same era.

Perspective reformulations of mixed integer nonlinear programming with indicator variables

O. Günlük and J. Linderoth · 2010

Cited alongside, same era.

Valid inequalities for the pooling problem with binary variables

C. D’Ambrosio, J. Linderoth, and J. Luedtke · 2011

Cited alongside, same era.

Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations

R. Jabr · 2012

Later among the works it cites.

On valid inequalities for quadratic programming with continuous variables and binary indicators

H. Dong and J. Linderoth · 2013

Later among the works it cites.

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

H. Hijazi, C. Coffrin, and P. Van Hentenryck · 2017

Later among the works it cites.

Strong formulations for quadratic optimization with M-matrices and indicator variables

A. Atamtürk and A. Gómez · 2018

Later among the works it cites.