Construction of balanced sports schedules using partitions into subleagues
2008
Abstract
Direct constructions for balanced tournaments known so far solve problems with 2n teams if 2n mod 3 not equal 1 or 2n = 2(p), 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. (C) 2007 Elsevier B.V. All rights reserved.
Details
Title
Construction of balanced sports schedules using partitions into subleagues
Author(s)
Geinoz, A. ; Ekim, T. ; de Werra, D.
Published in
Operations Research Letters
Volume
36
Pages
279-282
Date
2008
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
ROSE
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSE - Chair of Operations Research SE
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2010-11-30