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.)
Coverage remained the same at 0.0% when pulling a0b029a9655c53d63c42d06e51cf2a8565b2aa4f on arcondello:py37 into 091795dbf299601ed06647761ce427c90bdf8b6b on dwavesystems:master.
Coverage remained the same at 0.0% when pulling a0b029a9655c53d63c42d06e51cf2a8565b2aa4f on arcondello:py37 into 091795dbf299601ed06647761ce427c90bdf8b6b on dwavesystems:master.