Constructing timetables for sport competitions

DOI10.1007/BFb0120907zbMath0441.90043OpenAlexW144335064MaRDI QIDQ3883872

Jan A. M. Schreuder

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120907

zbMATH Keywords

algorithmschedulingHamiltonian cyclecomplete graphsnecessary and sufficient conditionsexistence conditionssoccercomplete matchingssports managementconstruction of feasible solutionsedge-colouring of complete graphsexistence of a competitionoriented edge-colouringtimetables for sport competitions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Operations research and management science (90B99) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib) ⋮ One-factorizations of the complete graph—A survey ⋮ A Benders approach for the constrained minimum break problem ⋮ Combinatorial aspects of construction of competition Dutch professional football leagues ⋮ IP models for round robin tournaments ⋮ Round robin scheduling -- a survey ⋮ Sports scheduling: Problems and applications ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ Recoloring subgraphs of \(K_{2n}\) for sports scheduling ⋮ A branching scheme for finding cost-minimal round robin tournaments ⋮ Scheduling the professional soccer leagues of Austria and Germany

This page was built for publication: Constructing timetables for sport competitions