E-viri
PDF
Recenzirano
Odprti dostop
-
Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric
ACM transactions on mathematical software, 03/2017, Letnik: 43, Številka: 4Journal Article
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.
