Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis

The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class of quantum annealing computer that maps QUBO onto a physical...

Celý popis

Podrobná bibliografia

Vydané v:	Networks Ročník 70; číslo 2; s. 79 - 97
Hlavní autori:	Lewis, Mark, Glover, Fred
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Wiley Subscription Services, Inc 01.09.2017
Predmet:	binary quadratic optimization Combinatorial analysis Empirical analysis Graph theory Heuristic methods Ising model network reduction Optimization Preprocessing quadratic unconstrained binary optimization quantum annealing Reduction Tabu search
ISSN:	0028-3045, 1097-0037
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!