Bdmst | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/bdmst/BdmstHugo Blox Builder (https://hugoblox.com)en-usFri, 01 May 2009 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngBdmsthttps://ac.tuwien.ac.at/tag/bdmst/Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-the-bounded-diameter-minimum-spanning-tree-problem/Fri, 01 May 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-the-bounded-diameter-minimum-spanning-tree-problem/A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instanceshttps://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristicshttps://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/