Markus Leitner

1.6k total citations
60 papers, 1.0k citations indexed

About

Markus Leitner is a scholar working on Industrial and Manufacturing Engineering, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Markus Leitner has authored 60 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Industrial and Manufacturing Engineering, 16 papers in Electrical and Electronic Engineering and 13 papers in Computational Theory and Mathematics. Recurrent topics in Markus Leitner's work include Vehicle Routing Optimization Methods (30 papers), Facility Location and Emergency Management (13 papers) and Advanced Optical Network Technologies (9 papers). Markus Leitner is often cited by papers focused on Vehicle Routing Optimization Methods (30 papers), Facility Location and Emergency Management (13 papers) and Advanced Optical Network Technologies (9 papers). Markus Leitner collaborates with scholars based in Austria, France and Netherlands. Markus Leitner's co-authors include Stefan Lagrosen, Ivana Ljubić, G. Brandstätter, Mario Ruthmair, Günther R. Raidl, Markus Sinnl, Luı́s Gouveia, Bin Hu, Michele Monaci and Matteo Fischetti and has published in prestigious journals such as European Journal of Operational Research, Transportation Research Part C Emerging Technologies and Transportation Research Part B Methodological.

In The Last Decade

Markus Leitner

57 papers receiving 924 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Markus Leitner Austria 16 283 227 216 190 135 60 1.0k
Zhaohan Sheng China 24 236 0.8× 79 0.3× 35 0.2× 92 0.5× 117 0.9× 103 1.6k
Helena Ramalhinho Spain 18 662 2.3× 175 0.8× 32 0.1× 76 0.4× 110 0.8× 61 1.1k
Zhuo Sun China 21 597 2.1× 141 0.6× 91 0.4× 49 0.3× 205 1.5× 66 1.3k
Zhong‐Zhong Jiang China 21 194 0.7× 61 0.3× 41 0.2× 49 0.3× 49 0.4× 66 1.0k
Richard D. McBride United States 15 270 1.0× 36 0.2× 58 0.3× 35 0.2× 73 0.5× 59 737
Laura Calvet Spain 15 314 1.1× 98 0.4× 33 0.2× 34 0.2× 50 0.4× 61 843
Knut Haase Germany 18 656 2.3× 170 0.7× 19 0.1× 116 0.6× 370 2.7× 50 1.2k
Stephen P. Bradley United States 13 106 0.4× 26 0.1× 134 0.6× 117 0.6× 30 0.2× 41 1.6k
Peter Belobaba United States 20 378 1.3× 227 1.0× 42 0.2× 54 0.3× 410 3.0× 49 2.1k
Xin Fu China 19 57 0.2× 41 0.2× 73 0.3× 29 0.2× 108 0.8× 58 982

Countries citing papers authored by Markus Leitner

Since Specialization
Citations

This map shows the geographic impact of Markus Leitner's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Markus Leitner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Markus Leitner more than expected).

Fields of papers citing papers by Markus Leitner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Markus Leitner. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Markus Leitner. The network helps show where Markus Leitner may publish in the future.

Co-authorship network of co-authors of Markus Leitner

This figure shows the co-authorship network connecting the top 25 collaborators of Markus Leitner. A scholar is included among the top collaborators of Markus Leitner based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Markus Leitner. Markus Leitner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dullaert, Wout, et al.. (2024). The role of individual compensation and acceptance decisions in crowdsourced delivery. Transportation Research Part C Emerging Technologies. 169. 104834–104834. 7 indexed citations
2.
Leitner, Markus, et al.. (2023). An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs. INFORMS journal on computing. 36(2). 479–494. 1 indexed citations
3.
Patten, Timothy, et al.. (2021). Object Learning for 6D Pose Estimation and Grasping from RGB-D Videos of In-hand Manipulation. 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). 4831–4838. 2 indexed citations
4.
Bomze, Immanuel M., et al.. (2020). Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization. Mathematics of Operations Research. 46(1). 301–316. 6 indexed citations
5.
Leitner, Markus, et al.. (2020). Benders decomposition for competitive influence maximization in (social) networks. Omega. 100. 102264–102264. 29 indexed citations
6.
Leitner, Markus, Ivana Ljubić, Martin Riedler, & Mario Ruthmair. (2019). Exact Approaches for Network Design Problems with Relays. INFORMS journal on computing. 31(1). 171–192. 6 indexed citations
7.
Gouveia, Luı́s, Markus Leitner, & Mario Ruthmair. (2018). Layered graph approaches for combinatorial optimization problems. Computers & Operations Research. 102. 22–38. 19 indexed citations
8.
Leitner, Markus, et al.. (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. 22 indexed citations
9.
Leitner, Markus, et al.. (2017). Decomposition methods for the two-stage stochastic Steiner tree problem. Computational Optimization and Applications. 69(3). 713–752. 6 indexed citations
10.
Grothmann, Torsten, et al.. (2017). A Five-Steps Methodology to Design Communication Formats That Can Contribute to Behavior Change. SAGE Open. 7(1). 12 indexed citations
11.
Leitner, Markus. (2016). Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems. Computational Optimization and Applications. 65(1). 73–92. 1 indexed citations
12.
Leitner, Markus, Ivana Ljubić, Juan‐José Salazar‐González, & Markus Sinnl. (2016). The connected facility location polytope. Discrete Applied Mathematics. 234. 151–167. 8 indexed citations
13.
Gouveia, Luı́s & Markus Leitner. (2016). Design of survivable networks with vulnerability constraints. European Journal of Operational Research. 258(1). 89–103. 9 indexed citations
14.
Gouveia, Luı́s, Markus Leitner, & Ivana Ljubić. (2013). Hop constrained Steiner trees with multiple root nodes. European Journal of Operational Research. 236(1). 100–112. 19 indexed citations
15.
Leitner, Markus, Ivana Ljubić, & Markus Sinnl. (2013). Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. Electronic Notes in Discrete Mathematics. 41. 181–188. 7 indexed citations
16.
Leitner, Markus & Günther R. Raidl. (2011). Branch-and-Cut-and-Price for Capacitated Connected Facility Location. Journal of Mathematical Modelling and Algorithms. 10(3). 245–267. 17 indexed citations
17.
Leitner, Markus, Mario Ruthmair, & Günther R. Raidl. (2011). Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem. 250–253. 2 indexed citations
18.
Leitner, Markus, Günther R. Raidl, & Ulrich Pferschy. (2009). Accelerating Column Generation for a Survivable Network Design Problem. 5 indexed citations
19.
Leitner, Markus & Günther R. Raidl. (2009). A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location. 7 indexed citations
20.
Leitner, Markus, Bin Hu, & Günther R. Raidl. (2007). Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026