Quadratic unconstrained binary optimization
Jump to navigation Jump to search
This article needs additional citations for verification. (September 2014) (Learn how and when to remove this template message)
QUBO is the problem of minimizing a quadratic polynomial over binary variables. The quadratic polynomial will be of the form with and .
- Tom Simonite (8 May 2013). "D-Wave's Quantum Computer Goes to the Races, Wins". MIT Technology Review. Retrieved 12 May 2013.
- Endre Boros, Peter L Hammer & Gabriel Tavares (April 2007). "Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)". Journal of Heuristics. Association for Computing Machinery. 13 (2): 99–132. doi:10.1007/s10732-007-9009-3. Retrieved 12 May 2013.
- Di Wang & Robert Kleinberg (November 2009). "Analyzing quadratic unconstrained binary optimization problems via multicommodity flows". Discrete Applied Mathematics. Elsevier. 157 (18): 3746–3753. doi:10.1016/j.dam.2009.07.009. Retrieved 12 May 2013.
|This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.|