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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 15; no. 3; pp. 445 - 470
Main Authors:	Rehfeldt, Daniel, Koch, Thorsten, Shinano, Yuji
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2023 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!