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