Constructing day-balanced round-robin tournaments with partitions

DOI10.1016/j.dam.2017.09.005zbMath1387.90084OpenAlexW2764289176MaRDI QIDQ1682881

Aras Erzurumluoğlu

Publication date: 6 December 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.09.005

zbMATH Keywords

sports schedulingbalanced tournamentfair (holey) 1-factorizationtournament with a byetournament with partitions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\), A tutorial on graph models for scheduling round‐robin sports tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete graphs
• Construction of balanced sports schedules using partitions into subleagues
• Constructing fair sports league schedules with regard to strength groups
• Combinatorial properties of strength groups in round robin tournaments
• Hamiltonian decompositions of complete regular s-partite graphs
• Construction of sports schedules with multiple venues
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
• Multiply balanced edge colorings of multigraphs
• Maximising common fixtures in a round robin tournament with two divisions
• On A Particular Conference Scheduling Problem