A tutorial on graph models for scheduling round‐robin sports tournaments
From MaRDI portal
Publication:6056890
DOI10.1111/itor.13290OpenAlexW4376568198MaRDI QIDQ6056890
Dominique de Werra, Celso Carneiro Ribeiro, Sebastián Urrutia
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13290
combinatorial optimizationcircle methodgraph theorysports schedulingtournament schedulinground robin
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling in sports: an annotated bibliography
- Balanced home-away assignments
- Construction of balanced sports schedules using partitions into subleagues
- Feasibility of home-away-pattern sets for round robin tournaments
- On the existence of sports schedules with multiple venues
- Premature sets of 1-factors or how not to schedule round robin tournaments
- Geography, games and graphs
- Minimizing irregularities in sports schedules using graph theory
- The spectrum of maximal sets of one-factors
- The existence of Room squares
- The existence of court balanced tournament designs
- Constructing day-balanced round-robin tournaments with partitions
- A polynomial-time algorithm to find an equitable home--away assignment
- Round-robin tournaments generated by the circle method have maximum carry-over
- Round robin scheduling -- a survey
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- Sports tournaments, home-away assignments, and the break minimization problem
- Construction of sports schedules with multiple venues
- Scheduling in Sports
- Sports scheduling: Problems and applications
- Decompositions of complete graphs into regular bichromatic factors
