English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The break minimization problem is a fundamental problem in sports scheduling.Recently, its quadratic unconstrained binary optimization (QUBO) formulationhas been proposed, which has gained much interest with the rapidly growingfield of quantum computing. In this paper, we demonstrate that thestate-of-the-art QUBO solver outperforms the general mixed integer quadraticprogramming (MIQP) solver on break minimization problems in a mirrored doubleround-robin tournament. Moreover, we demonstrate that it still outperforms oris competitive even if we add practical constraints, such as consecutiveconstraints, to the break minimization problem.

Solving break minimization problems in mirrored double round-robin tournament with QUBO solver