Edge coloring: a natural model for sports scheduling

DOI10.1016/j.ejor.2016.03.038zbMath1346.90354MaRDI QIDQ323273

Dominique de Werra, Tiago Januario, Sebastián Urrutia, Celso Carneiro Ribeiro

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.038

zbMATH Keywords

scheduling; local search; graph theory; edge coloring; OR in sports

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C90: Applications of graph theory

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

05C15: Coloring of graphs and hypergraphs

Related Items

A quest for a fair schedule: the international Young Physicists' Tournament, Determining the results of tournament games using complete graphs generation, The sport teams grouping problem, Round-robin tournaments generated by the circle method have maximum carry-over, Recoloring subgraphs of \(K_{2n}\) for sports scheduling, Integrated break and carryover effect minimization, Handling fairness issues in time-relaxed tournaments with availability constraints, Two-coloring triples such that in each color class every element is missed at least once, Total coloring and total matching: polyhedra and facets, Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of the traveling tournament problem
• On the application of graph colouring techniques in round-robin sports scheduling
• Scheduling in sports: an annotated bibliography
• Heuristics for the mirrored traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• Feasibility of home-away-pattern sets for round robin tournaments
• Approximating the maximum 2- and 3-edge-colorable subgraph problems
• Geography, games and graphs
• A constructive proof of Vizing's theorem
• A new neighborhood structure for round robin scheduling problems
• An ILS heuristic for the traveling tournament problem with predefined venues
• Computer science today. Recent trends and developments
• The traveling tournament problem with predefined 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
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• A perfect one-factorization ofK₅₂
• Scheduling in Sports
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• Sports scheduling: Problems and applications