Netdesign

Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods
May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy
PDF Cite
Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price
February 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and A.~Chwatal
PDF Cite
Heuristic methods for solving two Generalized Network Problems
February 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu
PDF Cite
A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem
2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (F. Xhafa and others), pages 356-361, 2010, Conference Publishing Services.
PDF Cite
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
2010, Technical report TR 186-1-10-01, Vienna University of Technology.
PDF Cite
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 239-251, 2010, Springer.
Note: best paper award winner
PDF Cite Project
Multilevel Variable Neighborhood Search for Periodic Routing Problems
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 226-238, 2010, Springer.
PDF Cite
Strong Lower Bounds for a Survivable Network Design Problem
ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari and A. R. Mahjoub), volume 36 of Electronic Notes in Discrete Mathematics, pages 295-302, 2010, Elsevier.
PDF Cite
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
Networks, volume 55, number 3, pages 256-275, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hu-07.pdf
Cite
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Parallel Problem Solving from Nature – PPSN XI, Part II (R. Schaefer and others), volume 6239 of LNCS, pages 391-400, 2010, Springer.
PDF Cite