qbsolv
Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.)
Main metrics
Overview
| Name With Owner | dwavesystems/qbsolv |
|---|---|
| Primary Language | q |
| Program language | C (Language Count: 8) |
| Platform | |
| License: | Apache License 2.0 |
| Release Count | 23 |
| Last Release Name | 0.3.4 (Posted on ) |
| First Release Name | qOp2.3_final (Posted on 2017-01-27 18:31:07) |
| Created At | 2017-01-06 18:18:22 |
| Pushed At | 2022-04-14 22:50:38 |
| Last Commit At | 2021-12-20 23:11:26 |
| Stargazers Count | 920 |
| Watchers Count | 121 |
| Fork Count | 232 |
| Commits Count | 415 |
| Has Issues Enabled | |
| Issues Count | 64 |
| Issue Open Count | 31 |
| Pull Requests Count | 91 |
| Pull Requests Open Count | 1 |
| Pull Requests Close Count | 10 |
| Has Wiki Enabled | |
| Is Archived | |
| Is Fork | |
| Is Locked | |
| Is Mirror | |
| Is Private |
