Construction of balanced sports schedules using partitions into subleagues

Authors:
A. Geinoz;T. Ekim;D. De Werra
Affiliations:
Ecole Polytechnique Fédérale de Lausanne (EPFL), Recherche Opérationnelle Sud-Est (ROSE), CH-1015 Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne (EPFL), Recherche Opérationnelle Sud-Est (ROSE), CH-1015 Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne (EPFL), Recherche Opérationnelle Sud-Est (ROSE), CH-1015 Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
2008

Citing 5
Cited 0

Solving the Sports League Scheduling Problem with Tabu Search

ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Scheduling a Major College Basketball Conference

Operations Research
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib)

Discrete Applied Mathematics
A constraint programming approach to the multiple-venue, sport-scheduling problem

Computers and Operations Research
Construction of sports schedules with multiple venues

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Direct constructions for balanced tournaments known so far solve problems with 2n teams if 2nmod31 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.