Solving large break minimization problems in a mirrored double round-robin tournament using quantum annealing.

ABSTRACT: Quantum annealing has gained considerable attention because it can be applied to combinatorial optimization problems, which have numerous applications in logistics, scheduling, and finance. In recent years, with the technical development of quantum annealers, research on solving practical combinatorial optimization problems using them has accelerated. However, researchers struggle to find practical combinatorial optimization problems, for which quantum annealers outperform mathematical optimization solvers. Moreover, there are only a few studies that compare the performance of quantum annealers with the state-of-the-art solvers, such as Gurobi and CPLEX. This study determines that quantum annealing demonstrates better performance than the solvers in that the solvers take longer to reach th

SUBMITTER: Kuramata M 

PROVIDER: S-EPMC8993026 | biostudies-literature | 2022

REPOSITORIES: biostudies-literature