Talks and Poster Presentations (with Proceedings-Entry):

A Chwatal, G. Raidl:
"Solving the minimum label spanning tree problem by ant colony optimization";
Talk: Conference on Genetic and Evolutionary Methods (GEM), Las Vegas, Nevada, USA; 2010-07-12 - 2010-07-15; in: "Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods", (2010), 91 - 97.

English abstract:
The Minimum Label Spanning Tree Problem
is a well known combinatorial optimization problem, having
applications in telecommunication network design and
data compression. The problem is NP-hard and cannot
be approximated within a constant factor. In this work
we present the application of ant colony optimization to
this problem. Different pheromone models and construction
mechanisms are introduced and local improvement methods
are considered. An experimental investigation of the outlined
components and a comparison to existing work are

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.