Round robin tournaments and three index assignments

DOI10.1007/S10288-010-0123-YzbMATH Open1208.90140OpenAlexW2025577534MaRDI QIDQ633482FDOQ633482

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

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

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)

Cites Work

• An Improved Approximation Algorithm for the Traveling Tournament Problem
• Title not available (Why is that?)
• A simulated annealing approach to the traveling tournament problem
• Complexity of a 3-dimensional assignment problem
• Title not available (Why is that?)
• Geography, games and graphs
• 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
• One-factorizations of the complete graph—A survey
• An algorithm for the planar three-index assignment problem
• Tabu search for the planar three-index assignment problem
• Minimizing irregularities in sports schedules using graph theory
• Title not available (Why is that?)
• IP models for round robin tournaments

Cited In (10)

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

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)