Round robin tournaments and three index assignments

DOI10.1007/s10288-010-0123-yzbMath1208.90140OpenAlexW2025577534MaRDI QIDQ633482

Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma

Publication date: 1 April 2011

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0123-y

zbMATH Keywords

computational complexitycombinatorial optimizationsports league schedulingplanar three index assignmentsround robin tournaments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (7)

On the complexity of pattern feasibility problems in time-relaxed sports timetabling ⋮ Integer programming models for round Robin tournaments ⋮ The sport teams grouping problem ⋮ A Lagrangian approach for minimum cost single round robin tournaments ⋮ A heuristic method for solving integer-valued decompositional multiindex problems ⋮ Combinatorial properties of strength groups in round robin tournaments ⋮ A branching scheme for finding cost-minimal round robin tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simulated annealing approach to the traveling tournament problem
• IP models for round robin tournaments
• Geography, games and graphs
• Minimizing irregularities in sports schedules using graph theory
• An algorithm for the planar three-index assignment problem
• Complexity of a 3-dimensional assignment problem
• Tabu search for the planar three-index assignment problem
• Round robin scheduling -- a survey
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• Scheduling the professional soccer leagues of Austria and Germany
• An Improved Approximation Algorithm for the Traveling Tournament Problem
• One-factorizations of the complete graph—A survey

This page was built for publication: Round robin tournaments and three index assignments