Complexity of the Unconstrained Traveling Tournament Problem

Authors

Rishiraj Bhattacharyya, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Operations Research Letters

Abstract

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.

First Page

649

Last Page

654

DOI

10.1016/j.orl.2016.07.011

Publication Date

9-1-2016

Recommended Citation

Bhattacharyya, Rishiraj, "Complexity of the Unconstrained Traveling Tournament Problem" (2016). Journal Articles. 4154.
https://digitalcommons.isical.ac.in/journal-articles/4154