Some proximity and sensitivity results in quadratic integer programming

In a recent paper, W. Cook et al. obtained some proximity results for integer linear programming problems with a fixed constraint matrix and varying objective function and right-hand-side vectors. Some of their main proximity results are extended to quadratic integer programming problems of the form max {c^Tx+x^TDx: Ax≤b, x integer}, where c and x are n-vectors, b is an m-vector, A is an integral m × n matrix and D is a negative semidefinite n × n matrix.