Sciweavers

Share
IPCO
2010

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

8 years 1 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the variables using suitably-defined lattice-free ellipsoids. Experiments show that our approach is very fast on both unconstrained problems and problems with box constraints. The main reason is that all expensive calculations can be done in a preprocessing phase, while a single node in the enumeration tree can be processed in linear time in the problem dimension.
Christoph Buchheim, Alberto Caprara, Andrea Lodi
Added 13 Feb 2011
Updated 13 Feb 2011
Type Journal
Year 2010
Where IPCO
Authors Christoph Buchheim, Alberto Caprara, Andrea Lodi
Comments (0)
books