Edge coloring: a natural model for sports scheduling

DOI10.1016/J.EJOR.2016.03.038MaRDI QIDQ323273zbMATH OpenOpenAlexFDO

Authors Tiago Januario, Sebastián Urrutia, Dominique De Werra, Celso C. 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

graph theoryOR in sportslocal searchschedulingedge coloring

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the application of graph colouring techniques in round-robin sports scheduling
• Recoloring subgraphs of \(K_{2n}\) for sports scheduling
• Interval edge-coloring: A model of curriculum scheduling
• Some models of graphs for scheduling sports competitions
• An application of edge coloring of graphs to a class scheduling problem
• A tutorial on graph models for scheduling round‐robin sports tournaments
• Extensions of coloring models for scheduling purposes
• Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms.
• Restricted coloring models for timetabling

Cites work

• scientific article; zbMATH DE number 42739 (Why is no real title available?)
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• scientific article; zbMATH DE number 3276424 (Why is no real title available?)
• A constructive proof of Vizing's theorem
• A new neighborhood structure for round robin scheduling problems
• A perfect one-factorization ofK₅₂
• A simulated annealing approach to the traveling tournament problem
• An ILS heuristic for the traveling tournament problem with predefined venues
• Approximating the maximum 2- and 3-edge-colorable subgraph problems
• Complexity of the traveling tournament problem
• Computer science today. Recent trends and developments
• Feasibility of home-away-pattern sets for round robin tournaments
• Geography, games and graphs
• Graph theory
• Heuristics for the mirrored traveling tournament problem
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• On the application of graph colouring techniques in round-robin sports scheduling
• Round robin scheduling -- a survey
• Scheduling in Sports
• Scheduling in sports: an annotated bibliography
• Sports scheduling: problems and applications
• Sports tournaments, home-away assignments, and the break minimization problem
• The traveling tournament problem with predefined venues
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂

Cited in

(15)

• On the application of graph colouring techniques in round-robin sports scheduling
• Scheduling an exciting set of rugby matches
• The sport teams grouping problem
• Interval edge-coloring: A model of curriculum scheduling
• Handling fairness issues in time-relaxed tournaments with availability constraints
• The tournament scheduling problem with absences
• Two-coloring triples such that in each color class every element is missed at least once
• Round-robin tournaments generated by the circle method have maximum carry-over
• Total coloring and total matching: polyhedra and facets
• Some models of graphs for scheduling sports competitions
• Round-robin tournaments generated by the circle method have maximum carry-over
• A quest for a fair schedule: the international Young Physicists' Tournament
• Recoloring subgraphs of \(K_{2n}\) for sports scheduling
• Integrated break and carryover effect minimization
• Determining the results of tournament games using complete graphs generation

This page was built for publication: Edge coloring: a natural model for sports scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323273)