Günther~R.~Raidl | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/gunther~r.~raidl/Günther~R.~RaidlHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngGünther~R.~Raidlhttps://ac.tuwien.ac.at/team/gunther~r.~raidl/Balancing Bicycle Sharing Systems: An Approach for the Dynamic Casehttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/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/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/