On the complexity of the traveling umpire problem
type: Item
instance of: scholarly article
title: On the complexity of the traveling umpire problem
zbMATH Open document ID: 1303.68062
author: Lucas de Oliveira
author: Tallys Yunes
author: Cid Carvalho de Souza
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6375971
zbMATH Keywords: traveling umpire problem
zbMATH Keywords: computational complexity
zbMATH Keywords: sports scheduling
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.09.037
OpenAlex ID: W2127566823
cites work: Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
cites work: Benders' cuts guided large neighborhood search for the traveling umpire problem
cites work: Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
cites work: Decomposition and local search based methods for the traveling umpire problem
cites work: An Improved Approximation Algorithm for the Traveling Tournament Problem
cites work: Q4198056
DOI: 10.1016/J.TCS.2014.09.037
description: scientific article; zbMATH DE number 6375971