Optimisation binaire quadratique sans contrainte

Définition

XXXXXXXXX

Français

XXXXXXXXX

Anglais

Quadratic unconstrained binary optimization

Quadratic unconstrained binary optimization (QUBO) is a pattern matching technique, common in machine learning applications. QUBO is an NP hard problem. Examples of problems that can be formulated as QUBO problems are the Maximum cut, Graph coloring and the Partition problem.[1]

QUBO problems may sometimes be well-suited to algorithms aided by quantum annealing.[2]

Source : Source : Wikipedia

Source : Wikipedia Machine learning algorithms