
doi: 10.1145/3005345
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.
Combinatorial optimization, Branch-and-bound, Integer programming, Quadratic programming, NP-hard, Binary quadratic programming, 510, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], quasi-Newton, exact resolution, semidefinite relaxations
Combinatorial optimization, Branch-and-bound, Integer programming, Quadratic programming, NP-hard, Binary quadratic programming, 510, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], quasi-Newton, exact resolution, semidefinite relaxations
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 35 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
