Markus Leitner
Biography
Markus Leitner is an Associate Professor at the Department of Operations Analytics at the School of Business and Economics, VU Amsterdam.
Markus' main research interests include combinatorial optimization and operations research (exact and heuristic techniques). Markus develops and applies methods based on mixed integer programming to solve challenging problems arising in network design, transportation, logistics, social network analysis, or telecommunication.
Publications
Kahr, M., Leitner, M. and Ljubic, I. (2024). The Impact of Passive Social Media Viewers in Influence Maximization INFORMS Journal on Computing, 36(6):1362--1381.
Leitner, M., Lodi, A., Roberti, R. and Sole, C. (2024). An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs INFORMS Journal on Computing, 36(2):479--494.
Leitner, M., Ljubic, I., Monaci, M., Sinnl, M. and Tanınmış, K. (2023). An Exact Method for Binary Fortification Games European Journal of Operational Research, 307(3):1026--1039.
Güney, E., Leitner, M., Ruthmair, M. and Sinnl, M. (2021). Large-scale influence maximization via maximal covering location European Journal of Operational Research, 289(1):144--164.
Bomze, ImmanuelM., Kahr, M. and Leitner, M. (2021). Trust your data or not—stqp remains stqp: Community detection via robust standard quadratic optimization Mathematics of Operations Research, 46(1):301--316.
Gouveia, L., Leitner, M., Ruthmair, M. and Sadykov, R. (2020). Corrigendum to “Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem” [European Journal of Operational Research, 262(3) 2017, 908–928] European Journal of Operational Research, 285(3):1199--1203.
Leitner, M., Ljubic, I., Riedler, M. and Ruthmair, M. (2019). Exact Approaches for Network Design Problems with Relays INFORMS Journal on Computing, 31(1):171--192.
Leitner, M., Ljubic, I., Luipersbeck, M. and Sinnl, M. (2018). 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.
Gouveia, L., Leitner, M. and Ruthmair, M. (2017). Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem European Journal of Operational Research, 262(3):908--928.
Brandstätter, G., Kahr, M. and Leitner, M. (2017). Determining optimal locations for charging stations of electric car-sharing under stochastic demand Transportation Research. Part B, Methodological, 104:17--35.
Leitner, M., Ljubic, I., Salazar-González, J. and Sinnl, M. (2017). An algorithmic framework for the exact solution of tree-star problems European Journal of Operational Research, 261(1):54--66.
Gouveia, L. and Leitner, M. (2017). Design of Survivable Networks with Vulnerability Constraint European Journal of Operational Research, 258(1):89--103.
Leitner, M., Ljubić, I. and Sinnl, M. (2015). A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem INFORMS Journal on Computing, 27:118--134.
Gouveia, L., Leitner, M. and Ljubić, I. (2014). Hop constrained Steiner trees with multiple root nodes European Journal of Operational Research, 236(1):100--112.