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

DOI10.1016/j.disopt.2005.08.009zbMath1146.90517OpenAlexW2078758919MaRDI QIDQ2506823

Gerhard F. Post, Gerhard J. Woeginger

Publication date: 10 October 2006

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2005.08.009

zbMATH Keywords

computational complexitysports schedulingtime tabling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial aspects of block designs (05B05) Management decision making, including multiple objectives (90B50)

Related Items (9)

Edge coloring: a natural model for sports scheduling ⋮ Balanced home-away assignments ⋮ A tutorial on graph models for scheduling round‐robin sports tournaments ⋮ First-break-heuristically-schedule: constructing highly-constrained sports timetables ⋮ Round-robin tournaments with homogeneous rounds ⋮ Tight bounds for break minimization in tournament scheduling ⋮ Feasibility of home-away-pattern sets for round robin tournaments ⋮ Round robin scheduling -- a survey ⋮ Sports scheduling: Problems and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A constrained sports scheduling problem
• Premature sets of 1-factors or how not to schedule round robin tournaments
• Some models of graphs for scheduling sports competitions
• Geography, games and graphs
• Minimizing irregularities in sports schedules using graph theory
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Minimizing breaks by maximizing cuts.
• Some APX-completeness results for cubic graphs
• A polynomial-time algorithm to find an equitable home--away assignment
• Scheduling in Sports
• Devising a Cost Effective Schedule for a Baseball League

This page was built for publication: Sports tournaments, home-away assignments, and the break minimization problem