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

Martin Gruber, Günther Raidl

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

Martin Gruber, Günther Raidl

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

Martin Gruber, Günther Raidl

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

Martin Gruber, Günther Raidl

2008, Technical report TR 186-1-08-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Günther Raidl, Martin Gruber

Numerical Analysis and Applied Mathematics (T. E. Simos and others), volume 1048 of AIP Conference Proceedings, pages 446-449, 2008, American Institute of Physics.

Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261-264, 2008, IEEE Computer Society.

Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO

Martin Gruber, Jano Van Hemert, Günther Raidl

Proceedings of the Genetic and Evolutionary Computation Conference – GECCO 2006 (Maarten Keijzer and others), pages 1187-1194, 2006, ACM.

A New 0--1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

Proceedings of the 2nd International Network Optimization Conference 2005 (L Gouveia and C. Mourão), pages 178-185, 2005.

Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem

Jakob Puchinger, Günther Raidl, Martin Gruber

Proceedings of MIC2005, the 6th Metaheuristics International Conference, pages 775-780, 2005.

Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl

Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.