×

Complexity of the unconstrained traveling tournament problem. (English) Zbl 1408.90122

Summary: 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.

MSC:

90B35 Deterministic scheduling theory in operations research
90C27 Combinatorial optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Anagnostopoulos, Aris; Michel, Laurent; Van Hentenryck, Pascal; Vergados, Yannis, A simulated annealing approach to the traveling tournament problem, J. Sched., 9, 2, 177-193 (2006) · Zbl 1154.90401
[2] Costa, Fabrício N.; Urrutia, Sebastián; Ribeiro, Celso C., An ILS heuristic for the traveling tournament problem with predefined venues, Ann. Oper. Res., 194, 1, 137-150 (2012) · Zbl 1251.90127
[6] Garey, M. R.; Johnson, David S., Computers and Intractability: A Guide to the Theory of \(N P\)-Completeness (1979), W. H. Freeman · Zbl 0411.68039
[7] Imahori, Shinji; Matsui, Tomomi; Miyashiro, Ryuhei, A 2.75-approximation algorithm for the unconstrained traveling tournament problem, Ann. Oper. Res., 218, 1, 237-247 (2014) · Zbl 1301.90037
[8] Kendall, Graham; Knust, Sigrid; Ribeiro, Celso C.; Urrutia, Sebastián, Scheduling in sports: An annotated bibliography, Comput. Oper. Res., 37, 1, 1-19 (2010) · Zbl 1171.90400
[9] Rasmussen, Rasmus V.; Trick, Michael A., Round robin scheduling — a survey, European J. Oper. Res., 188, 3, 617-636 (2008) · Zbl 1144.90396
[10] Thielen, Clemens; Westphal, Stephan, Complexity of the traveling tournament problem, Theoret. Comput. Sci., 412, 4-5, 345-351 (2011) · Zbl 1230.90102
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.