Minimizing irregularities in sports schedules using graph theory
From MaRDI portal
(Redirected from Publication:1165871)
Cites work
Cited in
(17)- A branching scheme for finding cost-minimal round robin tournaments
- Some models of graphs for scheduling sports competitions
- A Lagrangian approach for minimum cost single round robin tournaments
- A polynomial-time algorithm to find an equitable home--away assignment
- Scheduling sports competitions on multiple venues.
- 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
- A constraint programming approach to the multiple-venue, sport-scheduling problem
- Sports scheduling: problems and applications
- On the growth of maximal break intervals of equitable round-robin tournaments
- A generalization of interval edge-colorings of graphs
- A tutorial on graph models for scheduling round‐robin sports tournaments
- Round robin tournaments and three index assignments
- Break minimization in incomplete round-Robin tournaments
- Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America
- IP models for round robin tournaments
This page was built for publication: Minimizing irregularities in sports schedules using graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165871)