Netdesign

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers, others, eds.), volume 2037 of LNCS, pages 20–29, 2001, Springer.

I. Ljubić, Günther Raidl

Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search

Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector, others, eds.), pages 343–350, 2001, Morgan Kaufmann.

J. Gottlieb, B. A. Julstrom, F. Rothlauf, Günther Raidl

Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems

Proceedings of the 16th ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 321–326, 2001, ACM Press.

B. A. Julstrom, Günther Raidl

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem

Parallel Problem Solving from Nature – PPSN VI (K. Deb, others, eds.), volume 1917 of LNCS, pages 641–650, 2000, Springer.

I. Ljubić, Günther Raidl, J. Kratica

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.

Günther Raidl, C. Drexel

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.

Günther Raidl, Bryant A. Julstrom

An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

Proceedings of the 2000 IEEE Congress on Evolutionary Computation (C. Fonseca, others, eds.), pages 104–111, 2000, IEEE Press.