Active Set Methods with Reoptimization for Convex Quadratic Integer Programming
We present a fast branch-and-bound algorithm for solving convex quadratic integer programs with few linear constraints. In each node, we solve the dual problem of the continuous relaxation using an infeasible active set method proposed by Kunisch and Rendl  to get a lower bound; this active set algorithm is well suited for reoptimization. Our algorithm generalizes a branch-and-bound approach for unconstrained convex quadratic integer programming proposed by Buchheim, Caprara and Lodi  to the presence of linear constraints. The main feature of the latter approach consists in a sophisticated preprocessing phase, leading to a fast enumeration of the branch-and-bound nodes. Experimental results for randomly generated instances are presented. The new approach significantly outperforms the MIQP solver of CPLEX 12.4 for instances with a small number of constraints.
KeywordsQuadratic Program Dual Problem Interior Point Method Dual Approach Continuous Relaxation
- 1.IBM ILOG CPLEX Optimizer 12.4 (2013). http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/
- 13.Van Emde Boas, P.: Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical report 81–04, Department of Mathematics, University of Amsterdam (1981)Google Scholar