Global constraints for round robin tournament scheduling.

DOI10.1016/S0377-2217(03)00101-2zbMath1053.90037MaRDI QIDQ1417492

Tobias Müller, Martin Henz, Sven Thiel

Publication date: 5 January 2004

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

zbMATH Keywords

Graph theoryConstraints satisfactionTimetabling

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Gallai-Edmonds decomposition as a pruning technique ⋮ The timetable constrained distance minimization problem ⋮ A Benders approach for the constrained minimum break problem ⋮ Heuristics for the mirrored traveling tournament problem ⋮ Effort comparisons for a class of four-player tournaments ⋮ Cubic factorizations ⋮ Tournament scoring problem ⋮ IP models for round robin tournaments ⋮ Scheduling double round-robin tournaments with divisional play using constraint programming ⋮ Round robin scheduling -- a survey ⋮ A new constraint programming approach for optimising a coal rail system ⋮ Sports scheduling: Problems and applications ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ On the separation in 2-period double round robin tournaments with minimum breaks ⋮ On the application of graph colouring techniques in round-robin sports scheduling ⋮ A constraint programming approach to the multiple-venue, sport-scheduling problem ⋮ Scheduling the professional soccer leagues of Austria and Germany

Uses Software

• LEDA
• CPLEX
• Mozart
• Oz
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Scheduling sport tournaments using constraint logic programming
• Computer science today. Recent trends and developments
• Scheduling a Major College Basketball Conference—Revisited
• Scheduling in Sports
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Global constraints for round robin tournament scheduling.