Faster exact solution of sparse MaxCut and QUBO problems

The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic unconstrained binary optimization problem have experienced much interest in recent years. This article aims to advance the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming computation Jg. 15; H. 3; S. 445 - 470
Hauptverfasser:	Rehfeldt, Daniel, Koch, Thorsten, Shinano, Yuji
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2023 Springer Nature B.V
Schlagworte:	Algorithms Combinatorial analysis Exact solutions Full Length Paper Mathematical analysis Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Optimization Quantum computers Solvers Theory of Computation 90C10 90C27 Maximum-cut Branch-and-cut Quadratic unconstrained binary optimization
ISSN:	1867-2949, 1867-2957
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!