An approximation algorithm for the traveling tournament problem

DOI10.1007/s10479-010-0742-xzbMath1251.90170OpenAlexW2032550399MaRDI QIDQ1761909

Ryuhei Miyashiro, Shinji Imahori, Tomomi Matsui

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0742-x

zbMATH Keywords

schedulingapproximation algorithmlower boundtimetablingtournamenttraveling tournament problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

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 ⋮ Approximation algorithms for \(\mathrm{TTP(2)}\) ⋮ Complexity of the traveling tournament problem ⋮ A further improvement on approximating TTP-2 ⋮ An improved approximation algorithm for the traveling tournament problem ⋮ A 2.75-approximation algorithm for the unconstrained traveling tournament problem

Cites Work

• Unnamed Item
• Unnamed Item
• A Benders approach for the constrained minimum break problem
• A simulated annealing approach to the traveling tournament problem
• On the complexity of the \(k\)-customer vehicle routing problem
• Round robin scheduling -- a survey
• Bounds and Heuristics for Capacitated Routing Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: An approximation algorithm for the traveling tournament problem