Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
From MaRDI portal
Publication:2500541
DOI10.1016/J.DAM.2006.03.030zbMATH Open1113.90138OpenAlexW2064841285MaRDI QIDQ2500541FDOQ2500541
Celso C. Ribeiro, Sebastián Urrutia
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
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 (16)
- Round robin scheduling -- a survey
- 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
- 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
- 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
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)
