A 5.875-approximation for the traveling tournament problem
type: Item
instance of: scholarly article
title: A 5.875-approximation for the traveling tournament problem
zbMATH Open document ID: 1301.90044
author: Stephan Westphal
author: Karl Noparlik
published in: Annals of Operations Research
publication date: 2014-11-26T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6374073
zbMATH Keywords: sports scheduling
zbMATH Keywords: traveling tournament problem
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s10479-012-1061-1
OpenAlex ID: W1979001927
cites work: A simulated annealing approach to the traveling tournament problem
cites work: Heuristics for the mirrored traveling tournament problem
cites work: Scheduling in Sports
cites work: Q4475665
cites work: Scheduling in sports: an annotated bibliography
cites work: A simulated annealing and hill-climbing algorithm for the traveling tournament problem
cites work: Round robin scheduling -- a survey
cites work: Complexity of the traveling tournament problem
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: An Improved Approximation Algorithm for the Traveling Tournament Problem
DOI: 10.1007/S10479-012-1061-1
description: scientific article; zbMATH DE number 6374073