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.

翻译：休息轮次最小化问题是体育赛程编排中的基础问题。近年来，其二次无约束二元优化（QUBO）公式被提出，并随着量子计算领域的快速发展而受到广泛关注。本文证明，在镜像双循环赛的休息轮次最小化问题中，最先进的QUBO求解器优于通用混合整数二次规划（MIQP）求解器。此外，即使我们在休息轮次最小化问题中添加实际约束条件（如连续约束），该求解器仍能保持优势或具有竞争力。