@article{pia2017mixed-integer,
author = {Pia, Alberto Del and Dey, Santanu S. and Molinaro, Marco},
title = {Mixed-integer quadratic programming is in NP},
year = {2017},
month = {July},
abstract = {Mixed-integer quadratic programming (MIQP) is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing that if the decision version of mixed-integer quadratic programming is feasible, then there exists a solution of polynomial size. This result generalizes and unifies classical results that quadratic programming is in NP and integer linear programming is in NP.},
url = {http://approjects.co.za/?big=en-us/research/publication/mixed-integer-quadratic-programming-is-in-np/},
pages = {225-240},
journal = {Mathematical Programming},
volume = {162},
}