Complexity of the traveling tournament problem
C Thielen, S Westphal - Theoretical Computer Science, 2011 - Elsevier
We consider the complexity of the traveling tournament problem, which is a well-known
benchmark problem in tournament timetabling. The problem was supposed to be …
benchmark problem in tournament timetabling. The problem was supposed to be …
[PDF][PDF] Improved approximation algorithms for the traveling tournament problem
Abstract The Traveling Tournament Problem (TTP) is a well-known benchmark problem in
the field of tournament timetabling, which asks us to design a double round-robin schedule …
the field of tournament timetabling, which asks us to design a double round-robin schedule …
[PDF][PDF] The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound.
Abstract The Traveling Tournament Problem is a wellknown benchmark problem in
tournament timetabling, which asks us to design a schedule of home/away games of n …
tournament timetabling, which asks us to design a schedule of home/away games of n …
An improved scheduling algorithm for traveling tournament problem with maximum trip length two
D Chatterjee, BK Roy - arXiv preprint arXiv:2109.09065, 2021 - arxiv.org
The Traveling Tournament Problem (TTP) is a combinatorial optimization problem where we
have to give a scheduling algorithm which minimizes the total distance traveled by all the …
have to give a scheduling algorithm which minimizes the total distance traveled by all the …
Complexity of traveling tournament problem with trip length more than three
D Chatterjee - arXiv preprint arXiv:2110.02300, 2021 - arxiv.org
The Traveling Tournament Problem is a sports-scheduling problem where the goal is to
minimize the total travel distance of teams playing a double round-robin tournament. The …
minimize the total travel distance of teams playing a double round-robin tournament. The …
[PDF][PDF] Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem.
Unlike other NP-hard problems, the constraints on the traveling tournament problem are so
pressing that it's hardly possible to randomly generate a valid solution, for example, to use in …
pressing that it's hardly possible to randomly generate a valid solution, for example, to use in …
Complexity of the unconstrained traveling tournament problem
R Bhattacharyya - Operations Research Letters, 2016 - Elsevier
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 …
which minimizes the total travel distance maintaining some constraints on consecutive home …
The linear distance traveling tournament problem allows an EPTAS
Abstract The Traveling Tournament Problem (TTP-k) is a well-known benchmark problem in
tournament timetabling and has been extensively studied in the field of AI. In this problem …
tournament timetabling and has been extensively studied in the field of AI. In this problem …
A 1+ O (1/n) approximation algorithm for TTP (2)
S Imahori - arXiv preprint arXiv:2108.08444, 2021 - arxiv.org
The traveling tournament problem is a well-known benchmark problem of the sports
scheduling. We propose an approximation algorithm for the traveling tournament problem …
scheduling. We propose an approximation algorithm for the traveling tournament problem …
A further improvement on approximating TTP-2
Abstract The Traveling Tournament Problem (TTP) is a hard but interesting sports
scheduling problem inspired by Major League Baseball, which is to design a double round …
scheduling problem inspired by Major League Baseball, which is to design a double round …