Markus Sinnl

1.3k total citations
46 papers, 799 citations indexed

About

Markus Sinnl is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Organizational Behavior and Human Resource Management. According to data from OpenAlex, Markus Sinnl has authored 46 papers receiving a total of 799 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Industrial and Manufacturing Engineering, 14 papers in Computational Theory and Mathematics and 12 papers in Organizational Behavior and Human Resource Management. Recurrent topics in Markus Sinnl's work include Vehicle Routing Optimization Methods (20 papers), Facility Location and Emergency Management (12 papers) and Advanced Multi-Objective Optimization Algorithms (6 papers). Markus Sinnl is often cited by papers focused on Vehicle Routing Optimization Methods (20 papers), Facility Location and Emergency Management (12 papers) and Advanced Multi-Objective Optimization Algorithms (6 papers). Markus Sinnl collaborates with scholars based in Austria, France and Chile. Markus Sinnl's co-authors include Ivana Ljubić, Matteo Fischetti, Michele Monaci, Markus Leitner, Eduardo Álvarez‐Miranda, Domenico Salvagnin, Mario Ruthmair, Hesso Farhan, Fabio Furini and Juan‐José Salazar‐González and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

Markus Sinnl

45 papers receiving 774 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 Sinnl Austria 13 315 235 170 125 123 46 799
Antonio M. Rodríguez‐Chía Spain 18 517 1.6× 620 2.6× 101 0.6× 92 0.7× 137 1.1× 78 992
Mercedes Landete Spain 15 316 1.0× 226 1.0× 57 0.3× 59 0.5× 91 0.7× 50 657
Temel Öncan Türkiye 15 618 2.0× 114 0.5× 74 0.4× 144 1.2× 164 1.3× 36 958
Víctor Blanco Spain 15 167 0.5× 149 0.6× 124 0.7× 35 0.3× 71 0.6× 54 643
Marc Goerigk Germany 16 346 1.1× 201 0.9× 72 0.4× 43 0.3× 197 1.6× 70 930
Barbaros Ç. Tansel Türkiye 16 784 2.5× 781 3.3× 105 0.6× 202 1.6× 73 0.6× 35 1.4k
Jesús Sánchez‐Oro Spain 15 371 1.2× 111 0.5× 110 0.6× 130 1.0× 35 0.3× 53 651
Raca Todosijević France 23 763 2.4× 261 1.1× 33 0.2× 124 1.0× 97 0.8× 58 1.0k
Dong‐wan Tcha South Korea 15 506 1.6× 217 0.9× 105 0.6× 329 2.6× 63 0.5× 43 946
Jadranka Skorin‐Kapov United States 12 1.1k 3.5× 464 2.0× 77 0.5× 229 1.8× 87 0.7× 39 1.4k

Countries citing papers authored by Markus Sinnl

Since Specialization
Citations

This map shows the geographic impact of Markus Sinnl'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 Sinnl with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Markus Sinnl more than expected).

Fields of papers citing papers by Markus Sinnl

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Markus Sinnl. 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 Sinnl. The network helps show where Markus Sinnl may publish in the future.

Co-authorship network of co-authors of Markus Sinnl

This figure shows the co-authorship network connecting the top 25 collaborators of Markus Sinnl. A scholar is included among the top collaborators of Markus Sinnl 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 Sinnl. Markus Sinnl 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.
Álvarez‐Miranda, Eduardo, et al.. (2024). A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service. Computers & Operations Research. 173. 106845–106845.
2.
Parragh, Sophie N., et al.. (2024). An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems. Mathematical Methods of Operations Research. 100(1). 263–290. 3 indexed citations
3.
Lee, Jon, et al.. (2023). On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Mathematical Programming. 206(1-2). 91–124. 1 indexed citations
4.
Parragh, Sophie N., et al.. (2023). A matheuristic for tri-objective binary integer linear programming. Computers & Operations Research. 161. 106397–106397. 1 indexed citations
5.
Sinnl, Markus, et al.. (2023). Exact solution approaches for the discrete α‐neighbor p‐center problem. Networks. 82(4). 371–399. 2 indexed citations
7.
Sinnl, Markus, et al.. (2022). A Branch-and-Cut Algorithm for Submodular Interdiction Games. INFORMS journal on computing. 34(5). 2634–2657. 3 indexed citations
8.
Sinnl, Markus. (2021). Central European Journal of Operations Research / A note on computational approaches for the antibandwidth problem. University Library Linz repository (Johannes Kepler Universitat Linz). 3 indexed citations
9.
Leitner, Markus, et al.. (2020). Benders decomposition for competitive influence maximization in (social) networks. Omega. 100. 102264–102264. 29 indexed citations
10.
Álvarez‐Miranda, Eduardo & Markus Sinnl. (2019). An exact solution framework for the multiple gradual cover location problem. Computers & Operations Research. 108. 82–96. 6 indexed citations
11.
Álvarez‐Miranda, Eduardo, Marcos Goycoolea, Ivana Ljubić, & Markus Sinnl. (2019). The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. European Journal of Operational Research. 289(3). 1013–1029. 11 indexed citations
12.
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
13.
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
14.
Graser, Anita, et al.. (2017). 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. 12 indexed citations
15.
Furini, Fabio, Ivana Ljubić, & Markus Sinnl. (2017). An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. European Journal of Operational Research. 262(2). 438–448. 18 indexed citations
16.
Fischetti, Matteo, Michele Monaci, & Markus Sinnl. (2017). A dynamic reformulation heuristic for Generalized Interdiction Problems. European Journal of Operational Research. 267(1). 40–51. 21 indexed citations
17.
Álvarez‐Miranda, Eduardo, et al.. (2016). Solving minimum-cost shared arborescence problems. European Journal of Operational Research. 258(3). 887–901. 1 indexed citations
18.
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
19.
Álvarez‐Miranda, Eduardo, et al.. (2016). A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death. Annals of Operations Research. 258(1). 5–30. 2 indexed citations
20.
Álvarez‐Miranda, Eduardo, Markus Sinnl, & Hesso Farhan. (2015). Alteration of Golgi Structure by Stress: A Link to Neurodegeneration?. Frontiers in Neuroscience. 9. 435–435. 16 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