Breaks, cuts, and patterns

DOI10.1016/j.orl.2011.09.001zbMath1235.90061OpenAlexW3121509712MaRDI QIDQ408430

Dries R. Goossens, Frits C. R. Spieksma

Publication date: 5 April 2012

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

Full work available at URL: https://biblio.ugent.be/publication/5553759

zbMATH Keywords

complexitysport schedulingbreakshome-away patternsnonconsecutive rounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Scheduling the professional Ecuadorian football league by integer programming ⋮ On the complexity of pattern feasibility problems in time-relaxed sports timetabling ⋮ Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming ⋮ The flexibility of home away pattern sets ⋮ Multi-league sports scheduling with different leagues sizes ⋮ The multi-league sports scheduling problem, or how to schedule thousands of matches

Cites Work

• Scheduling in sports: an annotated bibliography
• Feasibility of home-away-pattern sets for round robin tournaments
• A combinatorial property of the maximum round robin tournament problem
• Minimizing breaks by maximizing cuts.
• A polynomial-time algorithm to find an equitable home--away assignment
• Scheduling in Sports
• On the complexity of comparing evolutionary trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Breaks, cuts, and patterns