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.)
Join the conversation
Reviews · Questions · Posts
Share what you know about qbsolv — write a review from your real experience, ask an implementation question, or publish a post about how you use it.
Share your experience
Write or update your review
Explain what worked, what broke down, and what another team should know before adopting qbsolv.
Project Q&A
Questions and answers
Browse implementation threads tied directly to dwavesystems/qbsolv. Each question links through to the full answer page.
Be the first to ask how teams run qbsolv in production. Every question you post becomes a durable, searchable answer page other developers can find.
Ask the first questionRelated posts
Posts tagged with the same topics
These posts come from the same topic surface as this repo, so readers can move from project evaluation into practical writeups and migration notes without leaving context.
Share how your team uses qbsolv — a migration note, an architecture writeup, or a comparison. Your post reaches everyone browsing these same topics.
Write the first post