248 search results - page 8 / 50 » Clustering Search Approach for the Traveling Tournament Prob... |
160
click to vote
WEA
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
176
click to vote
DCOSS
2011
Springer
14 years 5 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
163
click to vote
GECCO
2007
Springer
16 years 5 days ago
2007
Springer
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
147
click to vote
ALGORITHMICA
2004
15 years 5 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
151
click to vote
WAIM
2005
Springer
15 years 11 months ago
2005
Springer
Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they c...