Constructing fair round robin tournaments with a minimum number of breaks

Autor:	Gerhard F. Post, Dirk Briskorn, Pim van 't Hof
Přispěvatelé:	Discrete Mathematics and Mathematical Programming
Rok vydání:	2010
Předmět:	Round-robin tournaments Operations research Computer science Applied Mathematics Management Science and Operations Research Industrial and Manufacturing Engineering Scheduling (computing) Break Tournament Strength group Club Timetabling problem Mathematical economics Software Sports
Zdroj:	Operations research letters, 38(6), 592-596. Elsevier
ISSN:	0167-6377
DOI:	10.1016/j.orl.2010.08.008
Popis:	Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n−2, teams of the same club never play at home simultaneously, and they play against each other in the first round. We also consider a fairness constraint related to different playing strengths of teams competing in the tournament.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0642a40c52c042750e1aaf0fd3a2d316 https://doi.org/10.1016/j.orl.2010.08.008 Zobrazit plný text záznamu Full Text from ScienceDirect