Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks

DOI10.1016/j.orl.2013.06.007zbMath1286.90070OpenAlexW1976178837MaRDI QIDQ2450701

Shinji Mizuno, Lishun Zeng

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.06.007

zbMATH Keywords

sports schedulingbreakround robin tournamentstrength group

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Other designs, configurations (05B30)

Related Items (2)

A quest for a fair schedule: the international Young Physicists' Tournament ⋮ Scheduling asynchronous round-robin tournaments

Cites Work

• Constructing fair round robin tournaments with a minimum number of breaks
• IP models for round robin tournaments
• Constructing fair sports league schedules with regard to strength groups
• Combinatorial properties of strength groups in round robin tournaments
• Some models of graphs for scheduling sports competitions
• Geography, games and graphs
• A polynomial-time algorithm to find an equitable home--away assignment
• Round robin scheduling -- a survey
• Scheduling in Sports

This page was built for publication: Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks