On the application of graph colouring techniques in round-robin sports scheduling
From MaRDI portal
Publication:709125
DOI10.1016/j.cor.2010.04.012zbMath1231.90206OpenAlexW2077512078MaRDI QIDQ709125
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/11081/1/Lewi%2C_RSportsPaper.pdf
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)
Related Items (14)
Graph Coloring Lower Bounds from Decision Diagrams ⋮ Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem ⋮ Edge coloring: a natural model for sports scheduling ⋮ The tournament scheduling problem with absences ⋮ Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 ⋮ Two-coloring triples such that in each color class every element is missed at least once ⋮ A quest for a fair schedule: the international Young Physicists' Tournament ⋮ The international timetabling competition on sports timetabling (ITC2021) ⋮ A multi-round generalization of the traveling tournament problem and its application to Japanese baseball ⋮ Unnamed Item ⋮ A wide-ranging computational comparison of high-performance graph colouring algorithms ⋮ RobinX: a three-field classification and unified data format for round-robin sports timetabling ⋮ Fuzzy colouring of fuzzy graphs ⋮ Graph coloring with decision diagrams
Uses Software
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
- Heuristics for the mirrored traveling tournament problem
- A simulated annealing approach to the traveling tournament problem
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Some models of graphs for scheduling sports competitions
- Minimizing breaks by maximizing cuts.
- A robust simulated annealing based examination timetabling system.
- Global constraints for round robin tournament scheduling.
- A polynomial-time algorithm to find an equitable home--away assignment
- Scheduling a round robin tennis tournament under courts and players availability constraints
- An improved ant colony optimisation heuristic for graph colouring
- Round robin scheduling -- a survey
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- Neighborhood portfolio approach for local search applied to timetabling problems
- Scheduling fixtures for basketball New Zealand
- Scheduling the professional soccer leagues of Austria and Germany
- Scheduling the Italian football league: an ILP-based approach
- Semidefinite programming based approaches to the break minimization problem
- Metaheuristics for University Course Timetabling
- One-factorizations of the complete graph—A survey
- Almost all k-colorable graphs are easy to color
- New methods to color the vertices of a graph
- Allocating Games for the NHL Using Integer Programming
- Devising a Cost Effective Schedule for a Baseball League
- A Column Generation Approach for Graph Coloring
- There are 526,915,620 nonisomorphic one‐factorizations of K12
This page was built for publication: On the application of graph colouring techniques in round-robin sports scheduling
