Constructing fair round robin tournaments with a minimum number of breaks
From MaRDI portal
Publication:614051
DOI10.1016/j.orl.2010.08.008zbMath1202.90151OpenAlexW2009493580MaRDI QIDQ614051
Dirk Briskorn, Pim van 't Hof, Gerhard F. Post
Publication date: 23 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.08.008
Related Items (10)
Inequity averse optimization in operational research ⋮ Minimization of rest mismatches in round robin tournaments ⋮ Determining matchdays in sports league schedules to minimize rest differences ⋮ The flexibility of home away pattern sets ⋮ Round-robin scheduling with regard to rest differences ⋮ Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks ⋮ The kissing problem: how to end a gathering when everyone kisses everyone else goodbye ⋮ Scheduling double round-robin tournaments with divisional play using constraint programming ⋮ Scheduling asynchronous round-robin tournaments ⋮ Integrated break and carryover effect minimization
Cites Work
This page was built for publication: Constructing fair round robin tournaments with a minimum number of breaks
