Below is Solver model for the small CTAP example.  In summary, we maximize the sumproduct of the decision cells and the original MIQP objective function coefficients (negative of the diagonal of the Q matrix) subject to constraints on the amount of change for the decision cells, assignment constraints and capacity constraints.