  


An Effective BranchandBound Algorithm for Convex Quadratic Integer Programming
Christoph Buchheim(christoph.buchheimtudortmund.de) Abstract: We present a branchandbound 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 suitablydefined latticefree 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. Keywords: convex quadratic minimization, closest vector problem Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming ) Category 2: Nonlinear Optimization (Quadratic Programming ) Category 3: Convex and Nonsmooth Optimization (Convex Optimization ) Citation: Download: [PDF] Entry Submitted: 09/14/2010 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  