272 search results - page 15 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
ARCS
2004
Springer
14 years 1 months ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
ICML
1995
IEEE
14 years 9 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
ANTSW
2006
Springer
14 years 4 days ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...