BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems. 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.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Garraffa, Michele; Della Croce, Federico; Salassa, Fabio: An exact semidefinite programming approach for the max-mean dispersion problem (2017)
- Karimi, Sahar; Ronagh, Pooya: A subgradient approach for constrained binary optimization via quantum adiabatic evolution (2017)
- Krislock, Nathan; Malick, Jér^ome; Roupin, Frédéric: BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems (2017)