Computational Comparison of Exact Solution Methods for 0-1 Quadratic Programs: Recommendations for Practitioners

Abstract EN

This paper is concerned with binary quadratic programs (BQPs), which are among the most well-studied classes of nonlinear integer optimization problems because of their wide variety of applications.

While a number of different solution approaches have been proposed for tackling BQPs, practitioners need techniques that are both efficient and easy to implement.

We revisit two of the most widely used linearization strategies for BQPs and examine the effectiveness of enhancements to these formulations that have been suggested in the literature.

We perform a detailed large-scale computational study over five different classes of BQPs to compare these two linearizations with a more recent linear reformulation and direct submission of the nonlinear integer program to an optimization solver.

The goal is to provide practitioners with guidance on how to best approach solving BQPs in an effective and easily implemented manner.