Round-robin tournaments with homogeneous rounds
From MaRDI portal
Publication:475180
DOI10.1007/S10479-011-0981-5zbMATH Open1301.90030OpenAlexW2011535311MaRDI QIDQ475180FDOQ475180
Authors: Bregje Buiteveld, Erik van Holland, Gerhard Post, D.-J. Smit
Publication date: 26 November 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0981-5
Recommendations
- Constructing day-balanced round-robin tournaments with partitions
- Combinatorial properties of strength groups in round robin tournaments
- On the organization of round robin tournaments with constraints
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks
- Publication:3199426
Cites Work
- The CRC handbook of combinatorial designs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Combinatorial aspects of construction of competition Dutch professional football leagues
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Some models of graphs for scheduling sports competitions
- Geography, games and graphs
- Sports tournaments, home-away assignments, and the break minimization problem
- Title not available (Why is that?)
- Scheduling sports tournaments on a single court minimizing waiting times
- Hadamard matrices of order 764 exist
Cited In (27)
- Round robin scheduling -- a survey
- Title not available (Why is that?)
- Championship grids galore
- Fair incomplete tournaments with odd number of teams and large number of games
- Title not available (Why is that?)
- Homogeneous tournaments revisited
- Maximally pair separated round robin tournaments: ordering the blocks of a design
- Rank-One Round Robin Designs
- Title not available (Why is that?)
- Counting the number of round-robin tournament schedules
- Fair incomplete tournaments
- First-mover advantage in round-robin tournaments
- Title not available (Why is that?)
- Scheduling asynchronous round-robin tournaments
- Title not available (Why is that?)
- Win sequences for round-robin tournaments
- Title not available (Why is that?)
- Combinatorial properties of strength groups in round robin tournaments
- Maximising common fixtures in a round robin tournament with two divisions
- Orderings of finite fields and balanced tournaments
- Feasibility of home-away-pattern sets for round robin tournaments
- Triad designs
- Title not available (Why is that?)
- A variant of the round-robin scheduling problem.
- Scheduling CCRR tournaments
- Title not available (Why is that?)
- On the organization of round robin tournaments with constraints
This page was built for publication: Round-robin tournaments with homogeneous rounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475180)