A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

Günther Raidl, Bryant A. Julstrom
January 2000
PDF bib

Abstract

Full Citation:

Günther R. Raidl, Bryant A. Julstrom. A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. Proceedings of the 2000 ACM Symposium on Applied Computing (J. Carroll, others, eds.), pages 440–445, 2000, ACM Press.

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

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