Combinatorial properties of strength groups in round robin tournaments

DOI10.1016/j.ejor.2007.10.007zbMath1157.90503OpenAlexW1977891370MaRDI QIDQ1011217

Dirk Briskorn

Publication date: 8 April 2009

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

Full work available at URL: http://hdl.handle.net/10419/147667

zbMATH Keywords

fairnessround robin tournamentsstrength groupspartition of teams

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

Minimization of rest mismatches in round robin tournaments ⋮ Constructing fair round robin tournaments with a minimum number of breaks ⋮ Constructing day-balanced round-robin tournaments with partitions ⋮ Round-robin scheduling with regard to rest differences ⋮ Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks ⋮ IP models for round robin tournaments ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ Constructing fair sports league schedules with regard to strength groups ⋮ RobinX: a three-field classification and unified data format for round-robin sports timetabling ⋮ Scheduling asynchronous round-robin tournaments

Cites Work

• Unnamed Item
• Round robin tournaments and three index assignments
• Near 2-factorizations of \(2K_ n:\) Cycles of even length
• Geography, games and graphs
• Minimizing breaks by maximizing cuts.
• Two-factorizations of small complete graphs
• A polynomial-time algorithm to find an equitable home--away assignment
• Scheduling the professional soccer leagues of Austria and Germany

This page was built for publication: Combinatorial properties of strength groups in round robin tournaments