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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming computation Ročník 15; číslo 3; s. 445 - 470
Hlavní autori:	Rehfeldt, Daniel, Koch, Thorsten, Shinano, Yuji
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2023 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!