Complexity of the Unconstrained Traveling Tournament Problem

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


The Traveling Tournament problem is a problem of scheduling round robin leagues which minimizes the total travel distance maintaining some constraints on consecutive home and away matches. The problem was proven NP-hard when the upper bound on any consecutive home or away stint is 3. In this paper, we prove that even without the constraints on the consecutive home or away matches, the problem remains NP-Hard.

Original languageEnglish
Pages (from-to)649-654
Number of pages6
JournalOperations Research Letters
Issue number5
Publication statusPublished - 1 Sept 2016

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V.


  • NP-hard
  • Scheduling
  • Traveling Tournament Problem

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'Complexity of the Unconstrained Traveling Tournament Problem'. Together they form a unique fingerprint.

Cite this