Round robin tournaments and three index assignments

DOI10.1007/S10288-010-0123-YMaRDI QIDQ633482zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• IP models for round robin tournaments
• Minimizing costs in round robin tournaments with place constraints
• Sports leagues scheduling. Models, combinatorial properties, and optimization algorithms.
• On the organization of round robin tournaments with constraints
• Round robin scheduling -- a survey

Cites work

• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• scientific article; zbMATH DE number 1852126 (Why is no real title available?)
• scientific article; zbMATH DE number 1894374 (Why is no real title available?)
• A simulated annealing approach to the traveling tournament problem
• An Improved Approximation Algorithm for the Traveling Tournament Problem
• An algorithm for the planar three-index assignment problem
• Complexity of a 3-dimensional assignment problem
• Geography, games and graphs
• IP models for round robin tournaments
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• Minimizing irregularities in sports schedules using graph theory
• One-factorizations of the complete graph—A survey
• Round robin scheduling -- a survey
• Scheduling the professional soccer leagues of Austria and Germany
• Tabu search for the planar three-index assignment problem

Cited in

(13)

• On the complexity of pattern feasibility problems in time-relaxed sports timetabling
• Combinatorial properties of strength groups in round robin tournaments
• Integer programming models for round Robin tournaments
• IP models for round robin tournaments
• Rank-One Round Robin Designs
• Counting the number of round-robin tournament schedules
• A Lagrangian approach for minimum cost single round robin tournaments
• Scheduling a round robin tennis tournament under courts and players availability constraints
• A branching scheme for finding cost-minimal round robin tournaments
• Sports scheduling search space connectivity: a riffle shuffle driven approach
• Scheduling a triple round robin tournament for the best Danish soccer league
• The sport teams grouping problem
• A heuristic method for solving integer-valued decompositional multiindex problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633482)