On the complexity of the traveling umpire problem

DOI10.1016/j.tcs.2014.09.037zbMath1303.68062OpenAlexW2127566823MaRDI QIDQ476848

Tallys Yunes, Lucas de Oliveira, Cid Carvalho De Souza

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.037

zbMATH Keywords

computational complexitysports schedulingtraveling umpire problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Two exact algorithms for the traveling umpire problem ⋮ Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm

Cites Work

• Unnamed Item
• Decomposition and local search based methods for the traveling umpire problem
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• An Improved Approximation Algorithm for the Traveling Tournament Problem

This page was built for publication: On the complexity of the traveling umpire problem