Travelled to:1 × Cyprus
1 × Spain
2 × USA
Collaborated with:B.A.Julstrom R.L.Wainwright H.Feltl ∅
Talks about:algorithm (6) evolutionari (5) problem (5) weight (3) genet (3) tree (3) span (3) minimum (2) comput (2) track (2)
Person: Günther R. Raidl
DBLP: Raidl:G=uuml=nther_R=
Contributed to:
200420032002200120001999Wrote 8 papers:
- SAC-2004-FeltlR #algorithm #hybrid #problem #search-based
- An improved hybrid genetic algorithm for the generalized assignment problem (HF, GRR), pp. 990–995.
- SAC-2003-RaidlJ #algorithm #bound #heuristic #problem
- Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
- SAC-2002-JulstromR #algorithm #robust #set
- Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.
- SAC-2002-WainwrightR #optimisation
- Evolutionary computation and optimization track: SAC 2002 (RLW, GRR), p. 541.
- SAC-2001-JulstromR #algorithm #graph #problem
- Weight-biased edge-crossover in evolutionary algorithms for wto graph problems (BAJ, GRR), pp. 321–326.
- SAC-2001-WainwrightR #optimisation
- Evolutionary computation and optimization track (RLW, GRR), p. 315.
- SAC-2000-RaidlJ #algorithm #problem #search-based
- A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.
- SAC-1999-Raidl #algorithm #multi #problem #search-based
- A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem (GRR), pp. 291–296.