BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems

Nathan Krislock, Jérôme Malick, Frédéric Roupin

Abstract: This article presents BiqCrunch, an exact solver for binary quadratic optimization problems. BiqCrunch is a branch-and-bound method that uses an original, efficient semidefinite-optimization-based bounding procedure. It has been successfully tested on a variety of well-known combinatorial optimization problems, such as Max-Cut, Max-k-Cluster, and Max-Independent-Set. The code is publicly available online; a web interface and many conversion tools are also provided.