Martin Gruber

Recent Publications

Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem
May 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl
(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 209-230, 2009, Springer.
Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances
GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl and others), pages 263-270, 2009, ACM Press.
(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem
Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics (P. Hansen and others), 2008.
(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
2008, Technical report TR 186-1-08-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.