Rare find

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.)

github.com/dwavesystems/qbsolv

Vaya's read on this project

Problem, audience, market, and the verdict — sign in to see it.

Updates

No recent activity.