Evolcomp

Applications of Evolutionary Computing: EvoWorkshops 2003

Edge-Sets: An Effective Evolutionary Coding of Spanning Trees

Günther Raidl, B. A. Julstrom

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

Günther Raidl, B. A. Julstrom

A Memetic Algorithm for Vertex-Biconnectivity Augmentation

S. Kersting, Günther Raidl, I. Ljubić

Applications of Evolutionary Computing: EvoWorkshops 2002

Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem

Günther Raidl, I. Ljubić

Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges

B. A. Julstrom, Günther Raidl

Letting Ants Labeling Point Features

M. Schreyer, Günther Raidl

On Weight-Biased Mutation for Graph Problems

Günther Raidl, Gabriele Kodydek, Bryant Julstrom

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

I. Ljubić, Günther Raidl