Search

Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location

Networks, volume 61, number 2, pages 150-170, 2013.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz and others), volume 6927 of LNCS, pages 295-302, 2012, Springer.

Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem

Network Optimization: 5th International Conference, INOC 2011 (J. Pahl and T. Reiners and S. Voß), volume 6701 of LNCS, pages 124-138, June 2011, Springer.

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization, pages 250-253, May 2011.

On Stabilized Branch-and-Price for Constrained Tree Problems

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

Variable Neighborhood Search for Capacitated Connected Facility Location

2011, Technical report TR 186-1-11-01, Vienna University of Technology.

Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods

Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia and others), pages 261-263, 2011.

Markus Leitner

May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Strong Lower Bounds for a Survivable Network Design Problem

2010, Technical report TR 186-1-10-01, Vienna University of Technology.

The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search

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.

Accelerating Column Generation for a Survivable Network Design Problem

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

Markus Leitner, Günther Raidl, Ulrich Pferschy

Proceedings of the International Network Optimization Conference 2009 (M. G. Scutellá and others), April 2009.

A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location

Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location

Proceedings of the 8th Metaheuristics International Conference (Stefan Voss and Marco Caserta), 2009.

Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location

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

Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem

Chapter in Post-Conference Book of the Eight Metaheuristics International Conference – MIC 2009, 2009.
Note: to appear

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

Journal of Heuristics, volume 14, number 5, pages 473-499, 2008.

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 158-174, 2008, Springer.

The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search

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

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

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

Markus Leitner, Bin Hu, Günther Raidl

Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz), pages 69/1-6, 2007.

Solving Two Generalized Network Design Problems with Exact and Heuristic Methods

Markus Leitner

May 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and B.~Hu

Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem

Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

2006, Technical report TR 186-1-06-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.