On the complexity of the traveling umpire problem

Lucas de Oliveira, Cid C. de Souza, Tallys Yunes

Research output: Contribution to journalArticle

5 Scopus citations

Abstract

The traveling umpire problem (TUP) consists of determining which games will be handled by each one of several umpire crews during a double round-robin tournament. The objective is to minimize the total distance traveled by the umpires, while respecting constraints that include visiting every team at home, and not seeing a team or venue too often. Even small instances of the TUP are very difficult to solve, and several exact and heuristic approaches for it have been proposed in the literature. To this date, however, no formal proof of the TUP's computational complexity exists. We prove that the decision version of the TUP is NP-complete for certain values of its input parameters.

Original languageEnglish (US)
Pages (from-to)101-111
Number of pages11
JournalTheoretical Computer Science
Volume562
Issue numberC
DOIs
StatePublished - Jan 1 2015

Keywords

  • Computational complexity
  • Sports scheduling
  • Traveling umpire problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the complexity of the traveling umpire problem'. Together they form a unique fingerprint.

  • Cite this