Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

DOI10.1016/J.DAM.2006.03.030MaRDI QIDQ2500541zbMATHOpenAlexFDO

Authors Sebastián Urrutia, Celso C. Ribeiro

Publication date 17 August 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.03.030

zbMATH Keywords

heuristicstraveling tournament problembreaksround robin tournaments

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• The home-away assignment problems and break minimization/maximization problems in sports scheduling
• Tight bounds for break minimization in tournament scheduling
• Sports tournaments, home-away assignments, and the break minimization problem
• A branch-and-price algorithm for scheduling sport leagues
• Minimizing costs in round robin tournaments with place constraints

Cites work

• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• A polynomial-time algorithm to find an equitable home--away assignment
• A simulated annealing approach to the traveling tournament problem
• An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
• Devising a Cost Effective Schedule for a Baseball League
• Geography, games and graphs
• Heuristics for the mirrored traveling tournament problem
• Minimizing breaks by maximizing cuts.
• Minimizing irregularities in sports schedules using graph theory
• Scheduling in Sports
• Some models of graphs for scheduling sports competitions

Cited in

(24)

• Round robin tournaments and three index assignments
• Round robin scheduling -- a survey
• Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America
• Handling fairness issues in time-relaxed tournaments with availability constraints
• A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
• A Benders approach for computing lower bounds for the mirrored traveling tournament problem
• Sports tournaments, home-away assignments, and the break minimization problem
• Breaks, cuts, and patterns
• Heuristics for the mirrored traveling tournament problem
• Confection de calendriers de matchs pour le sport universitaire et collégial au Québec
• Tight bounds for break minimization in tournament scheduling
• Sports scheduling: problems and applications
• A Benders approach for the constrained minimum break problem
• On the separation in 2-period double round robin tournaments with minimum breaks
• A traditional Benders' approach to sports timetabling
• A tutorial on graph models for scheduling round‐robin sports tournaments
• On the growth of maximal break intervals of equitable round-robin tournaments
• On the generalized mirrored scheme for double round robin tournaments in sports scheduling
• Edge coloring: a natural model for sports scheduling
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem
• The home-away assignment problems and break minimization/maximization problems in sports scheduling
• Solving mirrored traveling tournament problem benchmark instances with eight teams
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem

This page was built for publication: Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

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