Minimizing irregularities in sports schedules using graph theory
From MaRDI portal
Publication:1165871
DOI10.1016/0166-218X(82)90042-7zbMath0488.05053MaRDI QIDQ1165871
Publication date: 1982
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (16)
Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Some models of graphs for scheduling sports competitions ⋮ 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 ⋮ IP models for round robin tournaments ⋮ Round robin scheduling -- a survey ⋮ Sports scheduling: Problems and applications ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ A polynomial-time algorithm to find an equitable home--away assignment ⋮ Maximizing breaks and bounding solutions to the mirrored traveling tournament problem ⋮ Sports tournaments, home-away assignments, and the break minimization problem ⋮ ON THE GROWTH OF MAXIMAL BREAK INTERVALS OF EQUITABLE ROUND-ROBIN TOURNAMENTS ⋮ A branching scheme for finding cost-minimal round robin tournaments ⋮ Scheduling sports competitions on multiple venues. ⋮ A constraint programming approach to the multiple-venue, sport-scheduling problem
Cites Work
This page was built for publication: Minimizing irregularities in sports schedules using graph theory
