Extensions on ellipsoid bounds for quadratic integer programming
- First Online:
- 26 Downloads
Ellipsoid bounds for strictly convex quadratic integer programs have been proposed in the literature. The idea is to underestimate the strictly convex quadratic objective function q of the problem by another convex quadratic function with the same continuous minimizer as q and for which an integer minimizer can be easily computed. We initially propose in this paper a different way of constructing the quadratic underestimator for the same problem and then extend the idea to other quadratic integer problems, where the objective function is convex (not strictly convex), and where the objective function is nonconvex and box constraints are introduced. The quality of the bounds proposed is evaluated experimentally and compared to the related existing methodologies.
KeywordsQuadratic integer programming Ellipsoid bound Integer relaxation
- 10.Fampa, M., Lee, J., Melo, W.: On global optimization with indefinite quadratics. EURO J. Comput. Optim. 5(3), 309–337 (2017)Google Scholar
- 24.Van Emde Boas, P.: Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical report 81-04, University of Amsterdam, Department of Mathematics (1981)Google Scholar