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

Features

  • Access to a D-Wave system must be arranged separately
  • qbsolv executes a quadratic unconstrained binary optimization (QUBO) problem represented in a file
  • qbsolv QUBO Input File Format
  • A decomposing solver that finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem
  • The pieces are solved using a classical solver running the tabu algorithm
  • qbsolv also enables configuring a D-Wave system as the solver

Project Samples

Qbsolv Screenshot 1

Project Activity

See All Activity >