Quadratic unconstrained binary optimization

ID: quadratic-unconstrained-binary-optimization

Quadratic Unconstrained Binary Optimization (QUBO) is a class of optimization problems where the objective is to minimize a quadratic objective function with binary variables. In a QUBO problem, the decision variables can only take two values: 0 or 1.
Quadratic unconstrained binary optimization by Ciro Santilli 37 Updated +Created

New to topics? Read the docs here!