A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
From MaRDI portal
Publication:421692
DOI10.1016/j.ejor.2011.06.014zbMath1237.90043OpenAlexW2002856610MaRDI QIDQ421692
Richard Hoshino, Ken-ichi Kawarabayashi
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.014
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90)
Related Items
Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Multi-league sports scheduling with different leagues sizes ⋮ RobinX: a three-field classification and unified data format for round-robin sports timetabling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Complexity of the traveling tournament problem
- On the application of graph colouring techniques in round-robin sports scheduling
- Scheduling in sports: an annotated bibliography
- A Benders approach for the constrained minimum break problem
- Heuristics for the mirrored traveling tournament problem
- A simulated annealing approach to the traveling 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
- An ILS heuristic for the traveling tournament problem with predefined venues
- Round robin scheduling -- a survey
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- A new branch-and-price algorithm for the traveling tournament problem
- DFS* and the Traveling Tournament Problem
This page was built for publication: A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
