A 5.875-approximation for the traveling tournament problem

DOI10.1007/S10479-012-1061-1zbMath1301.90044OpenAlexW1979001927MaRDI QIDQ475212

Stephan Westphal, Karl Noparlik

Publication date: 26 November 2014

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

Full work available at URL: https://doi.org/10.1007/s10479-012-1061-1

zbMATH Keywords

approximation algorithmssports schedulingtraveling tournament problem

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing

Cites Work

• Unnamed Item
• Complexity of the traveling tournament problem
• Scheduling in sports: an annotated bibliography
• Heuristics for the mirrored traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• Round robin scheduling -- a survey
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• An Improved Approximation Algorithm for the Traveling Tournament Problem
• Scheduling in Sports
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: A 5.875-approximation for the traveling tournament problem