A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program
From MaRDI portal
Abstract: In this paper, we propose a mixed-binary convex quadratic programming reformulation for the box-constrained nonconvex quadratic integer program and then implement IBM ILOG CPLEX 12.6 to solve the new model. Computational results demonstrate that our approach clearly outperform the very recent state-of-the-art solvers.
This page was built for publication: A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6248380)
