Sciweavers

930 search results - page 2 / 186
» An Improved Approximation Algorithm for the Traveling Tourna...
Sort
View
AAAI
2007
13 years 7 months ago
Population-Based Simulated Annealing for Traveling Tournaments
This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based...
Pascal Van Hentenryck, Yannis Vergados
HEURISTICS
2007
139views more  HEURISTICS 2007»
13 years 4 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
CPAIOR
2006
Springer
13 years 8 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
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
13 years 8 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
JDA
2006
90views more  JDA 2006»
13 years 4 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall