Raca Todosijević

1.6k total citations
58 papers, 1.0k citations indexed

About

Raca Todosijević is a scholar working on Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management and Artificial Intelligence. According to data from OpenAlex, Raca Todosijević has authored 58 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Industrial and Manufacturing Engineering, 20 papers in Organizational Behavior and Human Resource Management and 15 papers in Artificial Intelligence. Recurrent topics in Raca Todosijević's work include Vehicle Routing Optimization Methods (41 papers), Facility Location and Emergency Management (20 papers) and Metaheuristic Optimization Algorithms Research (13 papers). Raca Todosijević is often cited by papers focused on Vehicle Routing Optimization Methods (41 papers), Facility Location and Emergency Management (20 papers) and Metaheuristic Optimization Algorithms Research (13 papers). Raca Todosijević collaborates with scholars based in France, Serbia and Canada. Raca Todosijević's co-authors include Nenad Mladenović, Dragan Urošević, Saïd Hanafi, Jack Brimberg, Abdelghani Bekrar, Joseph Sarkis, Saïd Hanafi, Bernard Gendron, Pierre Hansen and El‐Ghazali Talbi and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Information Sciences.

In The Last Decade

Raca Todosijević

57 papers receiving 1.0k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Raca Todosijević France 23 763 261 187 155 124 58 1.0k
Temel Öncan Türkiye 15 618 0.8× 114 0.4× 97 0.5× 182 1.2× 144 1.2× 36 958
Saïd Hanafi France 23 1.1k 1.4× 145 0.6× 236 1.3× 165 1.1× 363 2.9× 90 1.5k
J. Marcos Moreno‐Vega Spain 20 868 1.1× 159 0.6× 266 1.4× 222 1.4× 91 0.7× 52 1.3k
Ching‐Jung Ting Taiwan 18 864 1.1× 155 0.6× 144 0.8× 305 2.0× 64 0.5× 52 1.2k
Nader Ghaffarinasab Iran 17 465 0.6× 225 0.9× 79 0.4× 116 0.7× 57 0.5× 28 739
Maria Grazia Scutellà Italy 19 704 0.9× 268 1.0× 89 0.5× 211 1.4× 286 2.3× 74 1.4k
Wolfgang Domschke Germany 14 860 1.1× 117 0.4× 101 0.5× 172 1.1× 147 1.2× 38 1.1k
Jordi Pereira Chile 21 1.0k 1.3× 88 0.3× 69 0.4× 83 0.5× 79 0.6× 52 1.3k
Masoud Hekmatfar Iran 5 649 0.9× 516 2.0× 57 0.3× 280 1.8× 107 0.9× 5 1.0k
Pasquale Avella Italy 17 582 0.8× 298 1.1× 70 0.4× 138 0.9× 127 1.0× 37 817

Countries citing papers authored by Raca Todosijević

Since Specialization
Citations

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

Fields of papers citing papers by Raca Todosijević

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Raca Todosijević

This figure shows the co-authorship network connecting the top 25 collaborators of Raca Todosijević. A scholar is included among the top collaborators of Raca Todosijević 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 Raca Todosijević. Raca Todosijević 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.
Todosijević, Raca, et al.. (2024). General variable neighborhood search for the capacitated single allocation hub maximal covering problem. Top. 33(2). 262–303. 1 indexed citations
2.
Benmansour, Rachid, et al.. (2024). Efficient algorithms for the bucket wheel reclaimer scheduling problem with sequence-dependent setup times. Annals of Operations Research. 351(1). 1109–1154. 1 indexed citations
3.
Brimberg, Jack, Saı̈d Salhi, Raca Todosijević, & Dragan Urošević. (2023). Variable Neighborhood Search: The power of change and simplicity. Computers & Operations Research. 155. 106221–106221. 42 indexed citations
4.
Saldanha‐da‐Gama, Francisco, et al.. (2023). Multi-period single-allocation hub location-routing: Models and heuristic solutions. European Journal of Operational Research. 310(1). 53–70. 9 indexed citations
5.
Mladenović, Nenad, et al.. (2023). Auxiliary data structures and techniques to speed up solving of the p -next center problem: A VNS heuristic. Applied Soft Computing. 140. 110276–110276. 6 indexed citations
6.
Bekrar, Abdelghani, et al.. (2021). Digitalizing the Closing-of-the-Loop for Supply Chains: A Transportation and Blockchain Perspective. Sustainability. 13(5). 2895–2895. 110 indexed citations
7.
Mladenović, Nenad, et al.. (2021). FILTERED VARIABLE NEIGHBORHOOD SEARCH METHOD FOR THE P-NEXT CENTER PROBLEM. International Journal for Traffic and Transport Engineering. 11(2). 294–309. 3 indexed citations
8.
Stanimirović, Zorica, et al.. (2021). Mathematical formulations and solution methods for the uncapacitated r -allocation p -hub maximal covering problem. Discrete Optimization. 43. 100672–100672. 3 indexed citations
9.
Gelareh, Shahin, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, & Raca Todosijević. (2019). The selective traveling salesman problem with draft limits. Journal of Heuristics. 26(3). 339–352. 7 indexed citations
10.
Gelareh, Shahin, et al.. (2018). A comparative study of formulations for a cross-dock door assignment problem. Omega. 91. 102015–102015. 38 indexed citations
11.
Stanimirović, Zorica, et al.. (2017). Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems. Annals of Operations Research. 259(1-2). 191–216. 23 indexed citations
12.
Hanafi, Saïd & Raca Todosijević. (2017). Mathematical programming based heuristics for the 0–1 MIP: a survey. Journal of Heuristics. 23(4). 165–206. 12 indexed citations
13.
Brimberg, Jack, Nenad Mladenović, Raca Todosijević, & Dragan Urošević. (2017). Solving the capacitated clustering problem with variable neighborhood search. Annals of Operations Research. 272(1-2). 289–321. 29 indexed citations
14.
Mladenović, Nenad, et al.. (2016). Solving the maximum min-sum dispersion by alternating formulations of two different problems. European Journal of Operational Research. 260(2). 444–459. 20 indexed citations
15.
Todosijević, Raca, Rachid Benmansour, Saïd Hanafi, Nenad Mladenović, & Abdelhakim Artiba. (2016). Nested general variable neighborhood search for the periodic maintenance problem. European Journal of Operational Research. 252(2). 385–396. 25 indexed citations
16.
Todosijević, Raca, et al.. (2015). Sequential variable neighborhood descent variants: An empirical study on Travelling salesman problem. Les Cahiers du GERAD. 1–14. 1 indexed citations
17.
Todosijević, Raca, et al.. (2015). Variable and single neighbourhood diving for MIP feasibility. SCIndeks. 1–23. 1 indexed citations
18.
Todosijević, Raca, et al.. (2014). Variable and single neighbourhood diving for MIP feasibility. Yugoslav journal of operations research. 26(2). 131–157. 17 indexed citations
19.
Mladenović, Nenad, Raca Todosijević, & Dragan Urošević. (2012). An Efficient General Variable Neighborhood Search for Large Travelling Salesman Problem with Time Windows. SCIndeks. 1–15. 2 indexed citations
20.
Mladenović, Nenad, Raca Todosijević, & Dragan Urošević. (2012). An efficient GVNS for solving Traveling Salesman Problem with Time Windows. Electronic Notes in Discrete Mathematics. 39. 83–90. 15 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