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

23 best points · 0 comments · 1 Hacker News post · 914 GitHub stars · View on GitHub

Hacker News discussions

• Qbsolv – Solving QUBO Problems in D-Wave (23 points, 0 comments, by EvgeniyZh, 2017-01-12)