A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem

Günther Raidl, C. Drexel
January 2000
PDF bib

Abstract

Full Citation:

G. R. Raidl, C. Drexel. A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem. Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pages 309–316, 2000.

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

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