Maximizing breaks and bounding solutions to the mirrored traveling tournament problem