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)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
94C15: Applications of graph theory to circuits and networks
05C20: Directed graphs (digraphs), tournaments
Related Items
Sports scheduling: Problems and applications, A generalization of interval edge-colorings of graphs, Round robin tournaments and three index assignments, IP models for round robin tournaments, 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
Cites Work