Quadratic unconstrained binary optimization
Trace. Question. Emerge.
Concept
Quadratic Unconstrained Binary Optimization L2
A quadratic unconstrained binary optimization is a type of mathematical problem that seeks to find the best solution among a set of binary variables that minimizes or maximizes a quadratic objective function.
Translations
- Quadratische unrestringierte binäre Optimierung German primary
- Quadratic unconstrained binary optimization English primary
- バイナリー二次計画問題 ja primary
Etymology
Loading Wiktionary entry…