B. A. Julstrom | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/b.-a.-julstrom/B. A. JulstromHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngB. A. Julstromhttps://ac.tuwien.ac.at/team/b.-a.-julstrom/A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Edge-Sets: An Effective Evolutionary Coding of Spanning Treeshttps://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Wed, 01 Jan 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edgeshttps://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/Tue, 01 Jan 2002 00:00:00 +0000https://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Searchhttps://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problemshttps://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/