98 search results - page 1 / 20 » Complexity of the traveling tournament problem |
TCS
2011
13 years 2 months ago
2011
Abstract. 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 computat...
HEURISTICS
2007
13 years 7 months ago
2007
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
EOR
2006
13 years 7 months ago
2006
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
AAAI
2007
13 years 9 months ago
2007
This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...