Jörg Kalcsics

1.2k total citations
44 papers, 696 citations indexed

About

Jörg Kalcsics is a scholar working on Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management and Computer Networks and Communications. According to data from OpenAlex, Jörg Kalcsics has authored 44 papers receiving a total of 696 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Industrial and Manufacturing Engineering, 25 papers in Organizational Behavior and Human Resource Management and 5 papers in Computer Networks and Communications. Recurrent topics in Jörg Kalcsics's work include Vehicle Routing Optimization Methods (26 papers), Facility Location and Emergency Management (25 papers) and Optimization and Search Problems (5 papers). Jörg Kalcsics is often cited by papers focused on Vehicle Routing Optimization Methods (26 papers), Facility Location and Emergency Management (25 papers) and Optimization and Search Problems (5 papers). Jörg Kalcsics collaborates with scholars based in Germany, United Kingdom and Spain. Jörg Kalcsics's co-authors include Stefan Nickel, Justo Puerto, Michael Schröder, Antonio M. Rodríguez‐Chía, Oded Berman, Dmitry Krass, Yolanda Hinojosa, Elena Fernández, Arie Tamir and Gilbert Laporte and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Journal of the Operational Research Society.

In The Last Decade

Jörg Kalcsics

41 papers receiving 680 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jörg Kalcsics Germany 16 388 367 177 89 73 44 696
Blas Pelegrı́n Spain 18 279 0.7× 363 1.0× 183 1.0× 88 1.0× 51 0.7× 60 700
Osman Alp Türkiye 15 343 0.9× 209 0.6× 122 0.7× 92 1.0× 90 1.2× 24 909
Samuel S. Chiu United States 12 394 1.0× 562 1.5× 225 1.3× 155 1.7× 65 0.9× 25 902
Navneet Vidyarthi Canada 17 447 1.2× 245 0.7× 94 0.5× 109 1.2× 63 0.9× 36 792
Yasemin Arda Belgium 10 582 1.5× 464 1.3× 168 0.9× 66 0.7× 106 1.5× 17 1.1k
Sergio García United Kingdom 12 240 0.6× 228 0.6× 104 0.6× 67 0.8× 50 0.7× 24 471
Monia Rekik Canada 13 381 1.0× 265 0.7× 109 0.6× 74 0.8× 91 1.2× 39 814
Christopher M. Rump United States 12 280 0.7× 241 0.7× 112 0.6× 120 1.3× 78 1.1× 21 861
Robert Aboolian United States 11 193 0.5× 332 0.9× 162 0.9× 112 1.3× 33 0.5× 13 536
Isabel Correia Portugal 18 659 1.7× 374 1.0× 251 1.4× 143 1.6× 97 1.3× 27 884

Countries citing papers authored by Jörg Kalcsics

Since Specialization
Citations

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

Fields of papers citing papers by Jörg Kalcsics

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jörg Kalcsics

This figure shows the co-authorship network connecting the top 25 collaborators of Jörg Kalcsics. A scholar is included among the top collaborators of Jörg Kalcsics 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 Jörg Kalcsics. Jörg Kalcsics 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.
Kalcsics, Jörg, et al.. (2025). Edge downgrades in the maximal covering location problem. Computers & Operations Research. 178. 107003–107003.
2.
Kalcsics, Jörg, et al.. (2024). On the complexity of the upgrading version of the maximal covering location problem. Networks. 83(4). 627–641. 1 indexed citations
3.
Handl, Julia, et al.. (2024). A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search. Computers & Operations Research. 172. 106791–106791. 8 indexed citations
4.
Fekete, Sándor P., et al.. (2022). Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game. Annals of Operations Research. 321(1-2). 79–101. 3 indexed citations
5.
Martí-García, S., et al.. (2022). Optimising portfolio diversification and dimensionality. Journal of Global Optimization. 85(1). 185–234. 1 indexed citations
6.
Fernández, Elena, Jörg Kalcsics, Stefan Nickel, & Roger Z. Rı́os-Mercado. (2022). A novel territory design model arising in the implementation of the WEEE-Directive. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology).
7.
Jörnsten, Kurt, et al.. (2020). A new semi-Lagrangean relaxation for the p-median problem. Journal of Information and Optimization Sciences. 41(8). 1771–1779. 1 indexed citations
8.
Delorme, Maxence, et al.. (2019). Mathematical models for stable matching problems with ties and incomplete lists. European Journal of Operational Research. 277(2). 426–441. 22 indexed citations
9.
Bender, Matthias, et al.. (2018). A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design. European Journal of Operational Research. 269(1). 382–396. 8 indexed citations
10.
Fernández, Elena, et al.. (2017). A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem. European Journal of Operational Research. 263(3). 805–814. 5 indexed citations
11.
Fernández, Elena, et al.. (2015). Scheduling policies for multi-period services. European Journal of Operational Research. 251(3). 751–770. 3 indexed citations
12.
Jörnsten, Kurt, et al.. (2015). A New Semi-Lagrangean Relaxation for the P-Median Problem. SSRN Electronic Journal. 1 indexed citations
13.
Jörnsten, Kurt & Jörg Kalcsics. (2015). A New Lagrangean Approach for the Travelling Salesman Problem. SSRN Electronic Journal.
14.
Kalcsics, Jörg, Stefan Nickel, Justo Puerto, & Antonio M. Rodríguez‐Chía. (2014). Several 2‐facility location problems on networks with equity objectives. Networks. 65(1). 1–9. 8 indexed citations
15.
Fernández, Elena, Jörg Kalcsics, & Stefan Nickel. (2012). The maximum dispersion problem. Omega. 41(4). 721–730. 17 indexed citations
16.
Berman, Oded, Jörg Kalcsics, Dmitry Krass, & Stefan Nickel. (2009). The Ordered Gradual Covering Location Problem on a Network. Discrete Applied Mathematics. 157(18). 3689–3707. 16 indexed citations
17.
Fernández, Elena, Jörg Kalcsics, Stefan Nickel, & Roger Z. Rı́os-Mercado. (2009). A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. Journal of the Operational Research Society. 61(3). 503–514. 27 indexed citations
18.
Kalcsics, Jörg, Stefan Nickel, Justo Puerto, & Antonio M. Rodríguez‐Chía. (2009). Distribution systems design with role dependent objectives. European Journal of Operational Research. 202(2). 491–501. 17 indexed citations
19.
Hinojosa, Yolanda, et al.. (2006). Dynamic supply chain design with inventory. Computers & Operations Research. 35(2). 373–391. 90 indexed citations
20.
Kalcsics, Jörg, Stefan Nickel, & Justo Puerto. (2002). Multifacility ordered median problems on networks: A further analysis. Networks. 41(1). 1–12. 32 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