On the application of graph colouring techniques in round-robin sports scheduling
type: Item
instance of: scholarly article
title: On the application of graph colouring techniques in round-robin sports scheduling
zbMATH Open document ID: 1231.90206
author: D. Kharzeev
published in: Computers \& Operations Research
publication date: 2010-10-15T00:00:00Z
full work available at URL: Lewi, RSportsPaper.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5800801
zbMATH Keywords: metaheuristics
zbMATH Keywords: sports scheduling
zbMATH Keywords: graph colouring
zbMATH Keywords: timetabling
describes a project that uses: DIMACS
MaRDI profile type: Publication
OpenAlex ID: W2077512078
cites work: A simulated annealing approach to the traveling tournament problem
cites work: Q4853739
cites work: Q4338936
cites work: Q4240558
cites work: Scheduling the professional soccer leagues of Austria and Germany
cites work: New methods to color the vertices of a graph
cites work: Q4012216
cites work: Q5687258
cites work: Some models of graphs for scheduling sports competitions
cites work: Scheduling the Italian football league: an ILP-based approach
cites work: Scheduling a round robin tennis tournament under courts and players availability constraints
cites work: Neighborhood portfolio approach for local search applied to timetabling problems
cites work: Q4221897
cites work: There are 526,915,620 nonisomorphic one‐factorizations of K12
cites work: Q4475665
cites work: Minimizing breaks by maximizing cuts.
cites work: Allocating Games for the NHL Using Integer Programming
cites work: Q4198056
cites work: Global constraints for round robin tournament scheduling.
cites work: Scheduling in sports: an annotated bibliography
cites work: A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
cites work: Metaheuristics for University Course Timetabling
cites work: A simulated annealing and hill-climbing algorithm for the traveling tournament problem
cites work: A Column Generation Approach for Graph Coloring
cites work: One-factorizations of the complete graph—A survey
cites work: A polynomial-time algorithm to find an equitable home--away assignment
cites work: Semidefinite programming based approaches to the break minimization problem
cites work: Round robin scheduling -- a survey
cites work: Heuristics for the mirrored traveling tournament problem
cites work: Devising a Cost Effective Schedule for a Baseball League
cites work: Q3815146
cites work: A robust simulated annealing based examination timetabling system.
cites work: An improved ant colony optimisation heuristic for graph colouring
cites work: Q2779815
cites work: Almost all k-colorable graphs are easy to color
cites work: Scheduling fixtures for basketball New Zealand
DOI: 10.1016/J.COR.2010.04.012
description: scientific article; zbMATH DE number 5800801