An Exact Algorithm for Quadratic Integer Minimization using Nonconvex Relaxations
We propose a branch-and-bound algorithm for minimizing a not necessarily convex quadratic function over integer variables. The algorithm is based on lower bounds computed as continuous minima of the objective function over appropriate ellipsoids. In the nonconvex case, we use ellipsoids enclosing the feasible region of the problem. In spite of the nonconvexity, these minima can be computed quickly. We present several ideas that allow to accelerate the solution of the continuous relaxation within a branch-and-bound scheme and examine the performance of the overall algorithm by computational experiments.
|Date of creation:||2012|
|Date of revision:|
|Contact details of provider:|| Phone: +390677274140|
Fax: +39 0677274129
Web page: http://www.dis.uniroma1.it
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2012-5. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antonietta Angelica Zucconi)
If references are entirely missing, you can add them using this form.