The Boolean Quadratic Programming problem is defined as follows
$$\displaystyle\min_{x \in \{0,1\}^n} f(x) = x^TQx + c^Tx$$
It is a well-studied NP-hard problem with many approximation algorithms proposed. I am interested in finding the number of minima given arbitrary $Q, c$.
If the problem as such is not well-studied then we can simplify it by adding some special conditions on $Q$ (like positive definiteness). In the worst case can we determine the number of minima if we remove the Boolean restriction and consider $x \in \mathbb R^n$ or $ x \in [0,1]^n$?
If there are papers or online links that I can refer that will help me sort this problem out, it will be of great help.
Thanks!