We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > A compact variant of the QCR method for quadrat...
View graph of relations

« Back

A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>04/2014
<mark>Journal</mark>Optimization Letters
Number of pages12
Early online date1/07/13
<mark>Original language</mark>English


Quadratic Convex Reformulation (QCR) is a technique that was originally proposed for quadratic 0-1 programs, and then extended to various other problems. It is used to convert non-convex instances into convex ones, in such a way that the bound obtained by solving the continuous relaxation of the reformulated instance is as strong as possible.

In this paper, we focus on the case of quadratically constrained quadratic 0-1 programs. The variant of QCR previously proposed for this case involves the addition of a quadratic number of auxiliary continuous variables. We show that, in fact, at most one additional variable is needed. Some computational results are also presented.

Bibliographic note

The original publication is available at www.link.springer.com