- M. Leitner, I. Ljubic, M. Luipersbeck, M. Sinnl. Decomposition methods for the two-stage stochastic Steiner tree problem, Computational Optimization and Applications, to appear 2018.
- L. Gouveia, M. Joyce-Moniz, and M. Leitner. Branch-and-cut methods for the network design problem with vulnerability constraints, Computers \& Operations Research, to appear 2018. (previous technical report)
- M. Leitner, I. Ljubic, M. Luipersbeck, and M. Sinnl, A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems, INFORMS Journal on Computing, to appear, 2018.
- G. Brandstätter, M. Kahr, and M. Leitner. Determining optimal locations for charging stations of electric car-sharing under stochastic demand, Transportation Research Part B: Methodological 104:17-35, 2017.
- L. Gouveia, M. Leitner, and M. Ruthmair. Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem, European Journal of Operational Research, to appear, 2017.
- M. Leitner, I. Ljubic, J.J. Salazar-Gonzalez, and M. Sinnl. An algorithmic framework for the exact solution of tree-star problems, European Journal of Operational Reserach, to appear, 2017. (previous technical report)
- H. Calik, M. Leitner, and M. Luipersbeck, A Benders decomposition based framework for solving cable trench problems, Computers & Operationes Research 81:128-140, 2017. (DOI:10.1016/j.cor.2016.12.015, previous technical report)
- M. Fischetti, M. Leitner, I. Ljubic, M. Luipersbeck, M. Monaci, M. Resch, D. Salvagnin, and M. Sinnl. Thinning out Steiner trees: a node based model for uniform edge costs, Mathematical Programming Computation, to appear, 2017. (preprint)
- L. Gouveia and M. Leitner. Design of Survivable Networks with Vulnerability Constraints, European Journal of Operational Research, to appear, 2017. (DOI:10.1016/j.ejor.2016.09.003, previous technical report)
- M. Leitner, I. Ljubic, J.J. Salazar-Gonzalez, and M. Sinnl. The Connected Facility Location Polytope, Discrete Applied Mathematics, to appear, 2017. (previous technical report)
- M. Leitner. Integer Programming Models and Branch-and-Cut Approaches to Generalized {0,1,2}-Survivable Network Design Problems, Computational Optimization and Applications 65:73-92, 2016. (DOI:10.1007/s10589-016-9836-y, previous technical report)
- M. Leitner, I. Ljubic, M. Sinnl, and A. Werner. ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design, Computers & Operations Research 72:128–146, 2016. (DOI:10.1016/j.cor.2016.02.006, previous technical report)
- M. Leitner. Layered Graph Models and Exact Algorithms for the Generalized Hop-Constrained Minimum Spanning Tree Problem, Computers & Operations Research, 65:1-18, 2016. (DOI:10.1016/j.cor.2015.06.012, previous technical report)
- L. Gouveia, M. Leitner, and I. Ljubic. The two-level diameter constrained spanning tree problem. Mathematical Programming, 150(1):49-78, 2015. (DOI:10.1007/s10107-013-0743-z, previous technical report)
- M. Leitner, I. Ljubic, and M. Sinnl. A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem. INFORMS Journal on Computing, 27:118-134, 2015. (DOI10.1287/ijoc.2014.0614, previous technical report)
- L. Gouveia, M. Leitner, and I. Ljubic. Hop Constrained Steiner Trees with multiple Root Nodes. European Journal of Operational Research, 236(1):100–112, 2014. (DOI:10.1016/j.ejor.2013.11.029, previous technical report)
- M. Leitner, M. Ruthmair, and G.R. Raidl. Stabilizing branch-and-price for constrained tree problems. Networks, 61(2):150-170, 2013. (DOI:10.1002/net.21484, previous technical report)
- M. Leitner, I. Ljubic, and M. Sinnl. Solving the bi-objective prize-collecting Steiner tree problem with the ε-constraint method. Electronic Notes in Discrete Mathematics 41:181-188, 2013. (DOI:10.1016/j.endm.2013.05.091, preprint)
- M. Leitner, I. Ljubic, M. Sinnl, and A. Werner. On the two-architecture connected facility location problem. Electronic Notes in Discrete Mathematics 41:359-366, 2013. (DOI:10.1016/j.endm.2013.05.113, preprint)
- J. Kratica, M. Leitner, and I. Ljubic. Variable neighborhood search for solving the balanced location problem. Electronic Notes in Discrete Mathematics 39:21-28, 2012. (DOI:10.1016/j.endm.2012.10.004, preprint)
- M. Leitner and G.R. Raidl. Branch-and-cut-and-price for capacitated connected facility location. Journal of Mathematical Modelling and Algorithms, 10(3):245-267, 2011. (DOI:10.1007/s10852-011-9153-5 , previous technical report)
- B. Hu, M. Leitner, and G.R. Raidl. The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks, 55(3):257-275, 2010. (DOI:10.1002/net.20370, previous technical report)
- M. Leitner and G.R. Raidl. Strong lower bounds for a survivable network design problem. Electronic Notes in Discrete Mathematics 36:295-302, 2010. (DOI:10.1016/j.endm.2010.05.038, preprint)
- B. Hu, M. Leitner, and G.R. Raidl. Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Journal of Heuristics, 14(5):473-499, 2008. (DOI:10.1007/s10732-007-9047-x, previous technical report)

- G. Brandstätter, C. Gambella, M. Leitner, E. Malaguti, F. Masini, J. Puchinger, M. Ruthmair, and D. Vigo. Overview of optimization problems in electric car-sharing system design and management. In H. Dawid et al., editors, Dynamic Perspectives on Managerial Decision Making. Springer, Berlin, 2016. accepted, to appear
- M. Leitner and G.R. Raidl. Combining Lagrangian decomposition with very large scale neighborhoood search for capacitated connected facility location. In Post-Conference Book of the 8th Metaheuristics International Conference – MIC 2009. to appear. (previous technical report)

- M. Leitner, I. Ljubic, J.J. Salazar-Gonzalez, and M. Sinnl. On the asymmetric connected facility location polytope. In P. Foilhoux et al., editors, International Symposium on Combinatorial Optimization 2014, volume 8596 of LNCS, pages 371–383, 2014. (DOI:10.1007/978-3-319-09174-7_32, preprint)
- M. Leitner, I. Ljubic, M. Luipersbeck, and M. Resch. A partition-based heuristic for the Steiner tree problem in large graphs. In M.J. Blesa et al., editors, Hybrid Metaheuristics, volume 8457 of LNCS, pages 56–70, 2014. (DOI:10.1007/978-3-319-07644-7_5, preprint)
- L. Gouveia, M. Leitner, and I. Ljubic. On the hop constrained Steiner tree problem with multiple root nodes. In A.R. Mahjoub et al., editors, Proceedings of the 2nd International Symposium on Combinatorial Optimization (ISCO), volume 7422 of LNCS, pages 201-212. Springer, 2012. (DOI:10.1007/978-3-642-32147-4_19, preprint)
- M. Leitner and G.R. Raidl. Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location. In R. Moreno-Diaz et al., editors, Computer Aided Systems Theory (EUROCAST) 2011, volume 6927 of LNCS, pages 295-302. Springer, 2012. (DOI:10.1007/978-3-642-27549-4_38, preprint)
- M. Leitner, M. Ruthmair, and G.R. Raidl. Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem. In J. Pahl et al., editors, Network Optimization: 5th International Conference (INOC), volume 6701 of LNCS, pages 124-138, Springer, 2011. (DOI:10.1007/978-3-642-21527-8_16, preprint)
- M. Leitner, M. Ruthmair, and G.R. Raidl. Stabilized column generation for the rooted delay-constrained Steiner tree problem. Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization, pages 250-253, 2011. (PDF)
- M. Leitner and G.R. Raidl. Variable neighborhood search for capacitated connected facility location. In A. Quesada-Arencibia et al., editors, Extended Abstracts of the Thirteenth International Conference on Computer Aided Systems Theory, pages 261-263, 2011. (PDF)
- M. Leitner and G.R. Raidl. A Lagrangian decomposition based heuristic for capacitated connected facility location. In S. Voand M. Caserta, editors, Proceedings of the 8th Metaheuristic International Conference (MIC), 2009. (PDF)
- M. Leitner, G.R. Raidl, and U. Pferschy. Accelerating column generation for a survivable network design problem. In M.G. Scutella et al., editors, Proceedings of the 4th International Network Optimization Conference (INOC), 2009. (PDF)
- M. Leitner and G.R. Raidl. Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks. In M.J. Blesa et al., editors, Hybrid Metaheuristics 2008, volume 5296 of LNCS, pages 158-174, Springer, 2008. (DOI:10.1007/978-3-540-88439-2_12, preprint)
- M. Leitner and G.R. Raidl. Variable neighborhood search for a prize collecting capacity constrained connected facility location problem. Proceedings of the International Symposium on Applications and the Internet (SAINT), pages 233-236, IEEE Comp. Soc., 2008. (DOI:10.1109/SAINT.2008.57, PDF)
- M. Leitner, B. Hu, and G.R. Raidl. Variable neighborhood search for the generalized minimum edge biconnected network problem. In B. Fortz, editor, Proceedings of the International Network Optimization Conference 2007, pages 69/1-6, 2007. (PDF)
- L. Fallon, D. Parker, M. Zach, M. Leitner, and S. Collins. Self-forming network management topologies in the Madeira management system. In Bandara et al., editors, Inter-Domain Management, volume 4543 of LNCS, pages 61-72. 2007. (DOI:10.1007/978-3-540-72986-0_6)
- M. Leitner, P. Leitner, M. Zach, S. Collins, and C. Fahy. Fault management based on peer-to-peer paradigms: A case study report from the CELTIC project Madeira. Proceedings of the 10th IFIP/IEEE Symposium on Integrated Management, pages 697-700, 2007. (DOI:10.1109/INM.2007.374830)
- B. Hu, M. Leitner, and G.R. Raidl. Computing generalized minimum spanning trees with variable neighborhood search. In P. Hansen et al., editors, Proceedings of the 18th Mini EURO Conference on Variable Neighborhood Search, 2005. (PDF)

- G. Brandstätter, M. Leitner, and I. Ljubic. Location of charging stations in electric car sharing systems, submitted, 2016. (PDF)
- M. Leitner, I. Ljubic, M. Riedler, and M. Ruthmair. Exact Approaches for Network Design Problems with Relays, submitted, 2015. (PDF)
- L. Gouveia, M. Leitner, and I. Ljubic. A polyhedral study of the diameter constrained minimum spanning tree problem, submitted, 2014. (PDF)
- M. Leitner, I. Ljubic, M. Luipersbeck, M. Prossegger, and M. Resch. New real-world instances for the Steiner tree problem in graphs. Technical report, ISOR, University of Vienna, 2014. (PDF)
- M. Leitner, G.R. Raidl, and U. Pferschy. Branch-and-price for a survivable network design problem. Technical Report TR 186-1-10-02, Vienna University of Technology, Vienna, Austria, 2010. (PDF)

- M. Leitner. Network Optimization: Algorithmic Approaches and Polyhedral Investigations. Cumulative habilitation thesis, University of Vienna, 2016.
- M. Leitner. Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods. PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2010. supervised by G. R. Raidl and U. Pferschy. (PDF)
- M. Leitner. Solving two generalized network design problems with exact and heuristic methods. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, 2006. supervised by G. Raidl and B. Hu. (PDF)

- G. Paulus, N. Prunner, C. Rauter, M. Prossegger, M. Leitner, J. Werner, and K. Rossegger. Entwicklung von kostenoptimierten räumlichen Szenarien für den strategischen Ausbau der Glasfasernetz-Infrastruktur am Beispiel eines Multi-Utility Unternehmens. 2. Forschungsforum der österreichischen Fachhochschulen (FFH 2008), 2008. (PDF)