Sciweavers

98 search results - page 2 / 20
» Scheduling Social Tournaments
Sort
View
HEURISTICS
2007
139views more  HEURISTICS 2007»
14 years 9 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
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...
Luca Di Gaspero, Andrea Schaerf
ORL
2010
158views more  ORL 2010»
14 years 4 months ago
Constructing fair round robin tournaments with a minimum number of breaks
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
DAM
2006
118views more  DAM 2006»
14 years 10 months ago
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization ...
Sebastián Urrutia, Celso C. Ribeiro
SAT
2004
Springer
73views Hardware» more  SAT 2004»
15 years 3 months ago
A SAT Based Scheduler for Tournament Schedules
We present a scheduler with a web interface for generating fair game schedules of a tournament. The tournament can be either single or double round-robin or something in between. T...
Hantao Zhang, Dapeng Li, Haiou Shen
CPAIOR
2006
Springer
15 years 1 months ago
Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling
Abstract. This paper considers all the variants of the traveling tournament prob) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United ...
Pascal Van Hentenryck, Yannis Vergados