BiqCrunch

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

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 6 articles , 1 standard article )

Showing results 1 to 6 of 6.
Sorted by year (citations)

  1. Hrga, Timotej; Lužar, Borut; Povh, Janez; Wiegele, Angelika: BiqBin: moving boundaries for NP-hard problems by HPC (2021)
  2. Furini, Fabio; Traversi, Emiliano; Belotti, Pietro; Frangioni, Antonio; Gleixner, Ambros; Gould, Nick; Liberti, Leo; Lodi, Andrea; Misener, Ruth; Mittelmann, Hans; Sahinidis, Nikolaos V.; Vigerske, Stefan; Wiegele, Angelika: QPLIB: a library of quadratic programming instances (2019)
  3. Buchheim, Christoph; Traversi, Emiliano: Quadratic combinatorial optimization using separable underestimators (2018)
  4. Garraffa, Michele; Della Croce, Federico; Salassa, Fabio: An exact semidefinite programming approach for the max-mean dispersion problem (2017)
  5. Karimi, Sahar; Ronagh, Pooya: A subgradient approach for constrained binary optimization via quantum adiabatic evolution (2017)
  6. Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric: BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems (2017)