Netdesign

A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of the International Network Optimization Conference 2009 (Maria Grazia Scutell`a and others), 2009.
PDF bib
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-D'iaz and others), volume 5717 of LNCS, pages 713-720, 2009, Springer.
PDF bib
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia and others), pages 244-246, 2009.
PDF bib
A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location
Proceedings of the 8th Metaheuristics International Conference (Stefan Voss and Marco Caserta), 2009.
PDF bib
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
9th International Conference on Hybrid Intelligent Systems – HIS~2009, pages 63-68, 2009.
Note: best paper award winner
PDF bib
Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem
Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia and others), pages 228-231, 2009.
PDF bib
Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location
2009, Technical report TR 186-1-09-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF bib
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.
PDF bib
Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates
Journal of Mathematical Modelling and Algorithms, volume 8, number 3, pages 293-334, 2009.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf
bib
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-D'iaz and others), volume 5717 of LNCS, pages 665-672, 2009, Springer.
PDF bib