Sciweavers

3 search results - page 1 / 1
» Theoretical Properties of Two ACO Approaches for the Traveli...
Sort
View
ANTSW
2010
Springer
13 years 2 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
ANTSW
2004
Springer
13 years 10 months ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr
FOCS
2006
IEEE
13 years 10 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans