A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Mario Ruthmair, Günther Raidl
January 2012
PDF bib

Abstract

Full Citation:

Mario Ruthmair, Günther R. Raidl. A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-D'iaz and others), volume 6927 of LNCS, pages 351-358, 2012, Springer.

Type
Conference Paper
Evolcomp Netdesign
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.