A combinatorial property of the maximum round robin tournament problem
From MaRDI portal
Publication:969517
DOI10.1016/j.orl.2009.10.008zbMath1185.90172OpenAlexW2004611190MaRDI QIDQ969517
Publication date: 7 May 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.10.008
Related Items
On the complexity of pattern feasibility problems in time-relaxed sports timetabling ⋮ The flexibility of home away pattern sets ⋮ Breaks, cuts, and patterns ⋮ Multi-league sports scheduling with different leagues sizes ⋮ The multi-league sports scheduling problem, or how to schedule thousands of matches
Uses Software
Cites Work
This page was built for publication: A combinatorial property of the maximum round robin tournament problem
