Summary: The class of mixed-integer quadratically constrained quadratic programs (QCQP) consists of minimizing a quadratic function under quadratic constraints where the variables could be integer or continuous. On a previous paper we introduced a method called MIQCR for solving QCQPs with the following restriction: all quadratic sub-functions of purely continuous variables are already convex. In this paper, we propose an extension of which applies to any QCQP. Let $$(P)$$ be a QCQP. Our approach to solve $$(P)$$ is first to build an equivalent mixed-integer quadratic problem $$(P^\ast)$$. This equivalent problem $$(P^\ast)$$ has a quadratic convex objective function, linear constraints, and additional variables $$y$$ that are meant to satisfy the additional quadratic constraints $$y=xx^{\mathrm{T}}$$, where $$x$$ are the initial variables of problem $$(P)$$. We then propose to solve $$(P^\ast)$$ by a branch-and-bound algorithm based on the relaxation of the additional quadratic constraints and of the integrality constraints. This type of branching is known as spatial branch-and-bound. Computational experiences are carried out on a total of 325 instances. The results show that the solution time of most of the considered instances is improved by our method in comparison with the recent implementation of QuadProgBB, and with the solvers Cplex, Couenne, Scip, BARON and GloMIQO.

### MSC:

 90C20 Quadratic programming 90C26 Nonconvex programming, global optimization 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut 90C11 Mixed integer programming

### Software:

SCIP; Bonmin; CSDP; ConicBundle; QuadProgBB; BARON; CPLEX; GloMIQO; Couenne; IQCP/MIQCP
Full Text: