Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

DOI10.1016/J.DAM.2006.03.030zbMATH Open1113.90138OpenAlexW2064841285MaRDI QIDQ2500541FDOQ2500541

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

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

zbMATH Keywords

heuristicstraveling tournament problembreaksround robin tournaments

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (22)

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

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)