Construction of balanced sports schedules using partitions into subleagues

DOI10.1016/j.orl.2007.09.007zbMath1151.90410OpenAlexW2060404406MaRDI QIDQ943779

A. Geinoz, Dominique de Werra, Tınaz Ekim

Publication date: 10 September 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.09.007

zbMATH Keywords

balanced tournamentsGraeco-Latin squares

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Constructing day-balanced round-robin tournaments with partitions ⋮ A tutorial on graph models for scheduling round‐robin sports tournaments

Uses Software

• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geography, games and graphs
• A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib)
• Construction of sports schedules with multiple venues
• A constraint programming approach to the multiple-venue, sport-scheduling problem
• ORTHOGONAL LATIN SQUARES
• A Tournament Design Problem
• An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem