Netdesign

Branch-and-Cut-and-Price for Capacitated Connected Facility Location
Journal of Mathematical Modelling and Algorithms, volume 10, number 3, pages 245-267, 2011, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/leitner-10b.pdf
Cite DOI
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints
Network Optimization: 5th International Conference, INOC 2011 (J. Pahl and T. Reiners and S. Voß), volume 6701 of LNCS, pages 105-117, 2011, Springer.
PDF Cite
On Stabilized Branch-and-Price for Constrained Tree Problems
2011, Technical report TR 186-1-11-01, Vienna University of Technology.
PDF Cite
Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques
Advances in Operations Research, volume 2011, number 143732, pages 1-38, 2011.
PDF Cite DOI
Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia and others), pages 285-287, 2011.
PDF Cite
Variable Neighborhood Search for Capacitated Connected Facility Location
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia and others), pages 261-263, 2011.
PDF Cite
Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem
September 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu
PDF Cite Project
Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods
August 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and A.~Chwatal
PDF Cite
Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem
July 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M.~Ruthmair
PDF Cite
On the Minimum Label Spanning Tree Problem: Solution Methods and Applications
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