Feasibility of home-away-pattern sets for round robin tournaments

DOI10.1016/j.orl.2007.09.009zbMath1142.91364OpenAlexW1972322518MaRDI QIDQ943780

Dirk Briskorn

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.009

zbMATH Keywords

round robin tournamentshome-away-pattern set feasibility problem

Mathematics Subject Classification ID

Decision theory for games (91A35)

Related Items (13)

Edge coloring: a natural model for sports scheduling ⋮ On the complexity of pattern feasibility problems in time-relaxed sports timetabling ⋮ A tutorial on graph models for scheduling round‐robin sports tournaments ⋮ The flexibility of home away pattern sets ⋮ Breaks, cuts, and patterns ⋮ First-break-heuristically-schedule: constructing highly-constrained sports timetables ⋮ Multi-league sports scheduling with different leagues sizes ⋮ A traditional Benders' approach to sports timetabling ⋮ The multi-league sports scheduling problem, or how to schedule thousands of matches ⋮ On the separation in 2-period double round robin tournaments with minimum breaks ⋮ A combinatorial property of the maximum round robin tournament problem ⋮ A branching scheme for finding cost-minimal round robin tournaments ⋮ ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING

Uses Software

• CPLEX

Cites Work

• Sports tournaments, home-away assignments, and the break minimization problem

This page was built for publication: Feasibility of home-away-pattern sets for round robin tournaments