, Volume 52, Issue 4, pp 797-829

An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach

Purchase on Springer.com

$39.95 / €34.95 / £29.95*

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We explore in this paper certain rich geometric properties hidden behind quadratic 0–1 programming. Especially, we derive new lower bounding methods and variable fixation techniques for quadratic 0–1 optimization problems by investigating geometric features of the ellipse contour of a (perturbed) convex quadratic function. These findings further lead to some new optimality conditions for quadratic 0–1 programming. Integrating these novel solution schemes into a proposed solution algorithm of a branch-and-bound type, we obtain promising preliminary computational results.

This work was supported by Research Grants Council of Hong Kong Grants CUHK4245/04E and 413606, by National Natural Science Foundation of China Grants 10971034 and 70832002, and by the Joint NSFC/RGC Grant 71061160506.