Sciweavers

248 search results - page 1 / 50
» Clustering Search Approach for the Traveling Tournament Prob...
Sort
View
MICAI
2007
Springer
14 years 1 months ago
Clustering Search Approach for the Traveling Tournament Problem
Fabrício Lacerda Biajoli, Luiz Antonio Nogu...
HEURISTICS
2007
139views more  HEURISTICS 2007»
13 years 7 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
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 10 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
EOR
2007
364views more  EOR 2007»
13 years 7 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
AAAI
2007
13 years 9 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