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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 2017-09, Vol.70 (2), p.79-97
Hauptverfasser:	Lewis, Mark, Glover, Fred
Format:	Artikel
Sprache:	eng
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!