A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
2022
ACM Transactions on Mathematical Software
We present BiqBin, an exact solver for linearly constrained binary quadratic problems. Our approach is based on an exact penalty method to first efficiently transform the original problem into an instance of Max-Cut, and then to solve the Max-Cut problem by a branch-and-bound algorithm. All the main ingredients are carefully developed using new semidefinite programming relaxations obtained by strengthening the existing relaxations with a set of hypermetric inequalities, applying the bundle
doi:10.1145/3514039
fatcat:hs5nv3fapbhxrce3btqsek6js4