Heuristics for the mirrored traveling tournament problem
From MaRDI portal
Publication:863992
DOI10.1016/j.ejor.2005.03.061zbMath1163.90531OpenAlexW1971110338MaRDI QIDQ863992
Sebastián Urrutia, Celso Carneiro Ribeiro
Publication date: 12 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.061
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (28)
Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ A combined local search and integer programming approach to the traveling tournament problem ⋮ The timetable constrained distance minimization problem ⋮ Edge coloring: a natural model for sports scheduling ⋮ Sports scheduling search space connectivity: a riffle shuffle driven approach ⋮ A new neighborhood structure for round robin scheduling problems ⋮ A nonmonotone GRASP ⋮ Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 ⋮ Let's meet as usual: do games played on non-frequent days differ? Evidence from top European soccer leagues ⋮ Confection de calendriers de matchs pour le sport universitaire et collégial au Québec ⋮ A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem ⋮ Fewer teams, more games, larger attendance? Evidence from the structural change in basketball's euroleague ⋮ A multi-round generalization of the traveling tournament problem and its application to Japanese baseball ⋮ Solving mirrored traveling tournament problem benchmark instances with eight teams ⋮ A 5.875-approximation for the traveling tournament problem ⋮ Round robin scheduling -- a survey ⋮ A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications ⋮ Sports scheduling: Problems and applications ⋮ An ILS heuristic for the traveling tournament problem with predefined venues ⋮ On the separation in 2-period double round robin tournaments with minimum breaks ⋮ On the application of graph colouring techniques in round-robin sports scheduling ⋮ The traveling tournament problem with predefined venues ⋮ A hybrid heuristic for the diameter constrained minimum spanning tree problem ⋮ RobinX: a three-field classification and unified data format for round-robin sports timetabling ⋮ Maximizing breaks and bounding solutions to the mirrored traveling tournament problem ⋮ A simulated annealing and hill-climbing algorithm for the traveling tournament problem ⋮ A Benders approach for computing lower bounds for the mirrored traveling tournament problem ⋮ A beam search approach to the traveling tournament problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simulated annealing approach to the traveling tournament problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Geography, games and graphs
- Combinatorial aspects of construction of competition Dutch professional football leagues
- Variable neighborhood search
- Global constraints for round robin tournament scheduling.
- Greedy randomized adaptive search procedures
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Combining simulated annealing with local search heuristics
- Scheduling a Major College Basketball Conference—Revisited
- Scheduling in Sports
- Devising a Cost Effective Schedule for a Baseball League
- An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
This page was built for publication: Heuristics for the mirrored traveling tournament problem
