**Journal Articles**

- E. Alvarez-Miranda and M. Sinnl, A Branch-and-Cut Algorithm for the Maximum Covering Cycle Problem.
*Annals of Operations Research*, 2018, online first. (technical report) - M. Fischetti, I. Ljubic, M. Monaci and M. Sinnl, Interdiction Games and Monotonicity.
*INFORMS Journal on Computing*, 2018, to appear. (technical report) - E. Alvarez-Miranda, M. Luipersbeck and M. Sinnl, An exact solution framework for the minimum cost dominating tree problem.
*Optimization Letters*, 2018, online first (technical report) - R. Fritze, A. Graser and M. Sinnl, Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria,
*International Journal of Medical Informatics*, 111:24-36, 2018 - M. Leitner, I. Ljubic, M. Luipersbeck and M. Sinnl, Decomposition methods for the two-stage stochastic Steiner tree problem.
*Computational Optimization and Applications*, 69(3):713-752, 2017. (technical report) - M. Fischetti, M. Monaci and M. Sinnl, A dynamic reformulation heuristic for Generalized Interdiction Problems.
*European Journal of Operational Research*, 267(1):40-51, 2018, (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*, 30(2):402-420, 2018, (technical report) - M. Fischetti, I. Ljubic, M. Monaci and M. Sinnl, Intersection Cuts for Bilevel Optimization.
*Mathematical Programming*, 2017, to appear. - E. Alvarez-Miranda, M. Luipersbeck and M. Sinnl, Gotta (efficiently) catch them all: Pokemon GO meets Orienteering Problems.
*European Journal of Operational Research*, 265(2):779-794, 2017 (technical report) - E. Alvarez-Miranda and M. Sinnl, A Relax-and-Cut Framework for Solving Large-Scale Maximum Weight Connected Subgraph Problems.
*Computers and Operations Research*, 87:63-82, 2017, (technical report) - M. Fischetti, I. Ljubic, M. Monaci and M. Sinnl, A new general-purpose algorithm for mixed-integer bilevel linear programs.
*Operations Research*, 65(6):1615-1637, 2017, (technical report) - F. Furini, I. Ljubic and M. Sinnl, An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem,
*European Journal of Operational Research*, 262(2):438-44, 2017, (technical report) - 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 Research*, 261(1):54-66, 2017, (technical report) - E. Alvarez-Miranda and M. Sinnl, Lagrangian and Branch-and-Cut Approaches for Upgrading Spanning Tree Problems.
*Computers and Operations Research*, 83:13-27, 2017 (technical report) - E. Alvarez-Miranda, I. Ljubic, M. Luipersbeck and M. Sinnl, Solving Minimum-Cost Shared Arborescence Problems,
*European Journal of Operational Research*, 258(3): 887-901, 2016 (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*, 9(2):203-229, 2017, (technical report) - M. Leitner, I. Ljubic, J.J. Salazar-Gonzalez and M. Sinnl, The connected facility location polytope,
*Discrete Applied Mathematics*, 2016, to appear (technical report) - E. Alvarez-Miranda, H. Farhan, M. Luipersbeck and M. Sinnl, A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death.
*Annals of Operations Research*, 2016, to appear (technical report) - M. Fischetti, I. Ljubic and M. Sinnl, Benders decomposition without separability: A computational study for capacitated facility location problems.
*European Journal of Operational Research*, 253(3): 557-569, 2016 - M. Sinnl and I. Ljubic, A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints.
*Mathematical Programming Computation*, 8(4), 461-490, 2016, (technical report) - M. Fischetti, I. Ljubic and M. Sinnl, Redesigning Benders Decomposition for Large Scale Facility Location.
*Management Science*, 63(7):2146-2162, 2017, (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 and Operations Research*, Volume 72, 128-146, 2016 (technical report) - E. Alvarez-Miranda, H. Farhan, and M. Sinnl, Alteration of Golgi structure by stress: a link to neurodegeneration?.
*Frontiers in Neuroscience*, Volume 9, 2015 - 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*, Volume 27, Issue 1, pages 118-134, 2014

**Refereed Conference Proceedings**

- M. Fischetti, I. Ljubic, M. Monaci and M. Sinnl, Intersection Cuts for Bilevel Optimization.
*Proceedings of IPCO 2016*, LNCS, Volume 9682, 77-88, Springer, 2016 (technical report) - E. Alvarez-Miranda, M. Luipersbeck and M. Sinnl, Optimal Upgrading Schemes for Effective Shortest Paths in Networks.
*Proceedings of CPAIOR 2016*, LNCS, Volume 9676, 406-420, Springer, 2016 (technical report) - F. Furini, I. Ljubic, and M. Sinnl, ILP and CP Formulations for the Lazy Bureaucrat Problem.
*Proceedings of CPAIOR 2015*, LNCS, Volume 9075, 255-270, Springer, 2015 - M. Leitner, I. Ljubic, J.J. Salzar-Gonzalez and M. Sinnl, On the asymmetric connected facility location polytope.
*Proceedings of ISCO 2014*, LNCS, Volume 8596, 371-383, Springer, 2014 - M. Leitner, I. Ljubic, and M. Sinnl. Solving the bi-objective prize-collecting Steiner tree problem with the epsilon-constraint method.
*Proceedings of INOC 2013, volume 41 of ENDM*, pages 181-188, Elsevier, 2013. - M. Leitner, I. Ljubic, M. Sinnl, and A. Werner. On the two-architecture connected facility location problem.
*Proceedings of INOC 2013, volume 41 of ENDM*, pages 359-366, Elsevier, 2013.

**Other Articles**

- M. Sinnl and I. Ljubic, A New Layered Graph Approach to Hop- and Diameter-constrained Spanning/Steiner Tree Problems in Graphs. Accepted for presentation at the Workshop of the 11th DIMACS implementation challenge
- M. Fischetti, M. Leitner, M. Luipersbeck, I. Ljubic, M. Monaci, D. Salvagnin, M. Sinnl and M. Resch, Thinning Out Steiner Trees
*.*Accepted for presentation at the Workshop of the 11th DIMACS implementation challenge

**Submitted Articles**

- E. Alvarez-Miranda and M. Sinnl, A note on computational aspects of the Steiner traveling salesman problem, (technical report)
- E. Alvarez-Miranda and M. Sinnl, Mixed-Integer Programming Approaches for the Tree t-spanner Problem, (technical report)

**PhD Thesis**

- M. Sinnl, Bi-objective Network Design, University of Vienna, Department of Statistics and Operations Research, August 2015. Supervised by I. Ljubic and I. Bomze

**Master Thesis**

- M. Sinnl, Branch-and-price for the Steiner Tree Problem with Revenues, Budget and Hop Constraints, Vienna University of Technology, Institute of Computer Graphics and Algorithms, August 2011. Supervised by G. Raidl and M. Leitner