论文部分内容阅读
In this talk,we solve two classes of quadratic integer programs:the box-constrained nonconvex quadratic integer program and the probabilistically con-strained quadratic program.We show by computational results that small changes in the reformulations when using CPLEX could highly outperform the state-of-the-art solvers.