Article ID Journal Published Year Pages File Type
1142800 Operations Research Letters 2008 4 Pages PDF
Abstract
Direct constructions for balanced tournaments known so far solve problems with 2n teams if 2nmod3≠1 or 2n=2p,p≥3 or n is odd. Our construction uses an arbitrary partition of the league into subleagues. It solves more than half of the missing cases and provides structured solutions for some known cases.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Construction of balanced sports schedules using partitions into subleagues
Authors
, , ,