Netdesign

Evolutionary Approach to Constrained Minimum Spanning Tree Problem

Evolutionary Computation and Global Optimization 2006 (Jaroslawa Arabasa), pages 331-341, 2006.

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

Proceedings of the Genetic and Evolutionary Computation Conference – GECCO 2006 (Maarten Keijzer and others), pages 1187-1194, 2006, ACM.

Martin Gruber, Jano Van Hemert, Günther Raidl

Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering

Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (Carlos Cotta and Antonio J. Fernandez and Jose E. Gallardo), 2006.

Bin Hu, Günther Raidl

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

Proceedings of the 2nd International Network Optimization Conference 2005 (L Gouveia and C. Mour~ao), pages 178-185, 2005.

Martin Gruber, Günther Raidl

Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and Jos'e A. Moreno P'erez and Bel'en Meli'an Batista and J. Marcos Moreno-Vega), 2005.

Bin Hu, Markus Leitner, Günther Raidl

Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem

Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and Jos'e A. Moreno P'erez and Bel'en Meli'an Batista and J. Marcos Moreno-Vega), 2005.

Martin Gruber, Günther Raidl

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

November 2004, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl

G"unther Gruber

An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem

Proceedings of the 2003 ACM Symposium on Applied Computing (H. M. Haddadd and others), pages 990-995, 2004, ACM Press.

Günther Raidl, H. Feltl

Biased Mutation Operators for Subgraph-Selection Problems

2004, Technical report TR 186-1-04-06, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Günther Raidl, Gabriele Koller, Bryant A. Julstrom

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

Genetic and Evolutionary Computation – GECCO 2004 (K.~ Deb and others), volume 3102 of LNCS, pages 1304-1315, 2004, Springer.

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