| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142033 | Operations Research Letters | 2016 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Rishiraj Bhattacharyya,