Minimizing costs in round robin tournaments with place constraints

DOI10.1016/j.cor.2009.01.004zbMath1162.90471MaRDI QIDQ1025238

Sigrid Knust, Daniel Lücking

Publication date: 18 June 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.004

zbMATH Keywords

integer programming; scheduling; breaks; round robin tournament; place constraints; sports leagues

Mathematics Subject Classification ID

90C10: Integer programming

90B36: Stochastic scheduling theory in operations research

Related Items

A Lagrangian approach for minimum cost single round robin tournaments, On the separation in 2-period double round robin tournaments with minimum breaks

Uses Software

• Choco

Cites Work

• Unnamed Item
• A Benders approach for the constrained minimum break problem
• A branching scheme for finding cost-minimal round robin tournaments
• Some models of graphs for scheduling sports competitions
• Scheduling a triple round robin tournament for the best Danish soccer league
• Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms.
• Round robin scheduling -- a survey
• Scheduling the professional soccer leagues of Austria and Germany
• Scheduling the Italian football league: an ILP-based approach
• A branch-and-price algorithm for scheduling sport leagues
• Scheduling in Sports