Sciweavers

873 search results - page 1 / 175
» Tournament scoring problem
Sort
View
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
13 years 4 months ago
Random Sampling of Labeled Tournaments
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
Lisa McShine
AMC
2008
72views more  AMC 2008»
13 years 5 months ago
Tournament scoring problem
Vasif V. Nabiyev, Hüseyin Pehlivan
TCS
2011
12 years 11 months ago
Complexity of the traveling tournament problem
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...
Clemens Thielen, Stephan Westphal
EOR
2006
97views more  EOR 2006»
13 years 4 months ago
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
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...
Andrew Lim, Brian Rodrigues, X. Zhang
JCT
1998
100views more  JCT 1998»
13 years 4 months ago
2-Partition-Transitive Tournaments
Given a tournament score sequence s1 ≥ s2 ≥ · · · ≥ sn, we prove that there exists a tournament T on vertex set {1, 2, . . . , n} such that the degree of any vertex i is ...
Barry Guiduli, András Gyárfás...