Minimizing costs in round robin tournaments with place constraints

DOI10.1016/J.COR.2009.01.004zbMath1162.90471OpenAlexW2070088139MaRDI QIDQ1025238

Daniel Lücking, Sigrid Knust

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 programmingschedulingbreaksround robin tournamentplace constraintssports leagues

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic scheduling theory in operations research (90B36)

Related Items (5)

Optimal routing for electric vehicle service systems ⋮ The flexibility of home away pattern sets ⋮ Multi-league sports scheduling with different leagues sizes ⋮ 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

This page was built for publication: Minimizing costs in round robin tournaments with place constraints