A multi-round generalization of the traveling tournament problem and its application to Japanese baseball

DOI10.1016/j.ejor.2011.06.014zbMath1237.90043MaRDI 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

zbMATH Keywords

scheduling; graph theory; timetabling; perfect matchings; traveling tournament problem; one-factorization

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90B90: Case-oriented studies in operations research

Related Items

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