Ruslan Sadykov

1.6k total citations
48 papers, 1.0k citations indexed

About

Ruslan Sadykov is a scholar working on Industrial and Manufacturing Engineering, Automotive Engineering and Computer Networks and Communications. According to data from OpenAlex, Ruslan Sadykov has authored 48 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Industrial and Manufacturing Engineering, 12 papers in Automotive Engineering and 11 papers in Computer Networks and Communications. Recurrent topics in Ruslan Sadykov's work include Vehicle Routing Optimization Methods (22 papers), Optimization and Packing Problems (21 papers) and Scheduling and Optimization Algorithms (18 papers). Ruslan Sadykov is often cited by papers focused on Vehicle Routing Optimization Methods (22 papers), Optimization and Packing Problems (21 papers) and Scheduling and Optimization Algorithms (18 papers). Ruslan Sadykov collaborates with scholars based in France, Brazil and Austria. Ruslan Sadykov's co-authors include François Vanderbeck, Eduardo Uchoa, Artur Alves Pessoa, François Vanderbeck, Laurence A. Wolsey, Rémy Dupas, Guillaume Marquès, François Clautiaux, Jean‐Christophe Deschamps and Philippe Baptiste and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Operations Research.

In The Last Decade

Ruslan Sadykov

46 papers receiving 966 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ruslan Sadykov France 17 834 270 204 159 86 48 1.0k
Ricardo Fukasawa Canada 14 689 0.8× 303 1.1× 163 0.8× 76 0.5× 46 0.5× 39 820
Nicola Bianchessi Italy 17 870 1.0× 364 1.3× 333 1.6× 302 1.9× 51 0.6× 37 1.2k
Joris Kinable United States 13 435 0.5× 214 0.8× 208 1.0× 145 0.9× 73 0.8× 23 702
Inmaculada Rodrı́guez-Martı́n Spain 14 630 0.8× 172 0.6× 233 1.1× 52 0.3× 38 0.4× 25 738
José M. Sanchis Spain 20 785 0.9× 229 0.8× 216 1.1× 59 0.4× 36 0.4× 50 906
Eleni Hadjiconstantinou United Kingdom 14 620 0.7× 142 0.5× 161 0.8× 67 0.4× 82 1.0× 23 779
Michel Toulouse Canada 16 416 0.5× 152 0.6× 176 0.9× 168 1.1× 48 0.6× 43 694
Pedro Munari Brazil 19 661 0.8× 240 0.9× 139 0.7× 62 0.4× 40 0.5× 54 882
Aziz Moukrim France 18 967 1.2× 146 0.5× 121 0.6× 131 0.8× 223 2.6× 69 1.2k
Pasquale Avella Italy 17 582 0.7× 83 0.3× 138 0.7× 127 0.8× 134 1.6× 37 817

Countries citing papers authored by Ruslan Sadykov

Since Specialization
Citations

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

Fields of papers citing papers by Ruslan Sadykov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ruslan Sadykov

This figure shows the co-authorship network connecting the top 25 collaborators of Ruslan Sadykov. A scholar is included among the top collaborators of Ruslan Sadykov 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 Ruslan Sadykov. Ruslan Sadykov 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.
Sadykov, Ruslan, et al.. (2024). A branch-cut-and-price approach for the two-echelon vehicle routing problem with drones. Computers & Operations Research. 173. 106869–106869. 4 indexed citations
2.
Sadykov, Ruslan, et al.. (2023). Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm. European Journal of Operational Research. 309(2). 488–505. 10 indexed citations
3.
Sadykov, Ruslan, et al.. (2023). Code and Data Repository for VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. INFORMS journal on computing. 1 indexed citations
4.
Munari, Pedro, et al.. (2023). A New Family of Route Formulations for Split Delivery Vehicle Routing Problems. Transportation Science. 57(5). 1359–1378. 4 indexed citations
5.
Giroire, Frédéric, Damien Saucez, Stéphane Pérennès, et al.. (2021). Design of robust programmable networks with bandwidth-optimal failure recovery scheme. Computer Networks. 192. 108043–108043. 5 indexed citations
6.
Pessoa, Artur Alves, Michaël Poss, Ruslan Sadykov, & François Vanderbeck. (2021). Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. Operations Research. 69(3). 739–754. 17 indexed citations
7.
Sadykov, Ruslan, et al.. (2021). A POPMUSIC matheuristic for the capacitated vehicle routing problem. Computers & Operations Research. 136. 105475–105475. 28 indexed citations
8.
Pessoa, Artur Alves, Ruslan Sadykov, Eduardo Uchoa, & François Vanderbeck. (2020). A generic exact solver for vehicle routing and related problems. Mathematical Programming. 183(1-2). 483–523. 112 indexed citations
9.
Clautiaux, François, et al.. (2019). Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. SHILAP Revista de lepidopterología. 7(3). 265–297. 10 indexed citations
10.
Marquès, Guillaume, Ruslan Sadykov, Jean‐Christophe Deschamps, & Rémy Dupas. (2019). An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Computers & Operations Research. 114. 104833–104833. 49 indexed citations
11.
Sadykov, Ruslan, et al.. (2018). A branch-and-price algorithm for the Minimum Latency Problem. Computers & Operations Research. 93. 66–78. 34 indexed citations
12.
Clautiaux, François, et al.. (2018). Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. Discrete Optimization. 29. 18–44. 15 indexed citations
13.
Gracheva, Elena, et al.. (2018). RESEARCH AND EVALUATION OF FUNCTIONAL PARAMETERS OF LOW VOLTAGE DEVICES. SHILAP Revista de lepidopterología. 20(5-6). 13–21.
14.
Pessoa, Artur Alves, Ruslan Sadykov, & Eduardo Uchoa. (2018). Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. European Journal of Operational Research. 270(2). 530–543. 37 indexed citations
15.
Sadykov, Ruslan. (2017). Evaluation of reliability of low voltage commercial networks of industrial power supply. SHILAP Revista de lepidopterología. 2 indexed citations
16.
Sadykov, Ruslan, et al.. (2017). THE STUDY OF PROBABILISTIC CHARACTERISTICS OF POWER SUPPLY SYSTEMS. SHILAP Revista de lepidopterología. 2 indexed citations
17.
Gracheva, Elena, A. R. Safin, & Ruslan Sadykov. (2017). Use of an analytical method for calculating reliability of elements of electric power systems based on probabilistic models. 10(1). 48–52. 6 indexed citations
18.
Sadykov, Ruslan, et al.. (2016). The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation. European Journal of Operational Research. 252(3). 750–760. 8 indexed citations
19.
Sadykov, Ruslan & François Vanderbeck. (2012). Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm. INFORMS journal on computing. 25(2). 244–255. 99 indexed citations
20.
Sadykov, Ruslan. (2009). On scheduling malleable jobs to minimise the total weighted completion time. IFAC Proceedings Volumes. 42(4). 1514–1516. 1 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