Netdesign

Evolutionary Approach to Constrained Minimum Spanning Tree Problem

Anna Pagacz, Günther Raidl, Stanislaw Zawiślak

Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO

Martin Gruber, Jano Van Hemert, Günther Raidl

Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering

Bin Hu, Günther Raidl

A New 0--1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

Bin Hu, Markus Leitner, Günther Raidl

Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem

G"unther Gruber

An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem

Günther Raidl, H. Feltl

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

G.W.~Klau, I.~Ljubić, A.~Moser, P.~Mutzel, P.~Neuner and U.~Pferschy, Günther Raidl, R.~Weiskircher

Ein evolutionärer Algorithmus zur L\s̈ung des Vertex-Biconnectivity Augmentation Problems

Sandor Alexander Kersting