A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program

Yong Xia; Ying-Wei Han

A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program

Optimization and Control 2014-01-24 v1

Authors: Yong Xia , Ying-Wei Han

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.

Keywords

linear programming

Cite

@article{arxiv.1401.5881,
  title  = {A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program},
  author = {Yong Xia and Ying-Wei Han},
  journal= {arXiv preprint arXiv:1401.5881},
  year   = {2014}
}

Comments

8pages

Related papers

View all related →