A New Lower Bound to the Traveling Tournament Problem

Abstract

Optimization in sports is a field of increasing interest. The traveling tournament problem abstracts certain characteristics of sports scheduling problems. We propose a new method for determining a lower bound to this problem. The new bound improves upon the previously best known lower bound. Numerical results on benchmark instances showed reductions as large as 38.6% in the gaps between lower and upper bounds.