A. G. Chent︠s︡ov

1.4k total citations
186 papers, 741 citations indexed

About

A. G. Chent︠s︡ov is a scholar working on Industrial and Manufacturing Engineering, Aerospace Engineering and Mathematical Physics. According to data from OpenAlex, A. G. Chent︠s︡ov has authored 186 papers receiving a total of 741 indexed citations (citations by other indexed papers that have themselves been cited), including 62 papers in Industrial and Manufacturing Engineering, 31 papers in Aerospace Engineering and 21 papers in Mathematical Physics. Recurrent topics in A. G. Chent︠s︡ov's work include Optimization and Packing Problems (39 papers), Vehicle Routing Optimization Methods (38 papers) and Advanced Manufacturing and Logistics Optimization (28 papers). A. G. Chent︠s︡ov is often cited by papers focused on Optimization and Packing Problems (39 papers), Vehicle Routing Optimization Methods (38 papers) and Advanced Manufacturing and Logistics Optimization (28 papers). A. G. Chent︠s︡ov collaborates with scholars based in Russia, Austria and Ukraine. A. G. Chent︠s︡ov's co-authors include A. N. Sesekin, О. Л. Ташлыков, Michael Khachay, Artem Baklanov, С. Е. Щеклеин, A. A. Chikriĭ, В. Н. Ушаков, Н. Н. Петров, В. В. Васин and Арлен Михайлович Ильин and has published in prestigious journals such as SHILAP Revista de lepidopterología, International Journal of Production Research and Energies.

In The Last Decade

A. G. Chent︠s︡ov

156 papers receiving 617 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
A. G. Chent︠s︡ov Russia	13	269	89	83	78	61	186	741
Lou Caccetta Australia	11	46 0.2×	11 0.1×	80 1.0×	23 0.3×	27 0.4×	35	514
Shengjie Li China	13	54 0.2×	13 0.1×	415 5.0×	13 0.2×	22 0.4×	85	643
Rachid Ellaia Morocco	11	22 0.1×	15 0.2×	144 1.7×	20 0.3×	67 1.1×	78	408
Hiroshi Yabe Japan	23	18 0.1×	57 0.6×	518 6.2×	44 0.6×	47 0.8×	101	1.4k
Liguo Zhang China	14	24 0.1×	14 0.2×	52 0.6×	40 0.5×	60 1.0×	118	788
J. Medanić United States	19	193 0.7×	6 0.1×	114 1.4×	128 1.6×	40 0.7×	95	1.3k
P. Kaelo Botswana	11	35 0.1×	34 0.4×	283 3.4×	12 0.2×	345 5.7×	33	712
Fabiano Luís de Sousa Brazil	13	57 0.2×	9 0.1×	96 1.2×	141 1.8×	56 0.9×	42	515
Jim Kennedy United Kingdom	5	27 0.1×	5 0.1×	67 0.8×	22 0.3×	145 2.4×	10	364

Countries citing papers authored by A. G. Chent︠s︡ov

Since Specialization

Citations

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

Fields of papers citing papers by A. G. Chent︠s︡ov

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by A. G. Chent︠s︡ov. 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 A. G. Chent︠s︡ov. The network helps show where A. G. Chent︠s︡ov may publish in the future.

Co-authorship network of co-authors of A. G. Chent︠s︡ov

This figure shows the co-authorship network connecting the top 25 collaborators of A. G. Chent︠s︡ov. A scholar is included among the top collaborators of A. G. Chent︠s︡ov 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 A. G. Chent︠s︡ov. A. G. Chent︠s︡ov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Chent︠s︡ov, A. G.. (2024). The routing bottlenecks problem (optimization within zones). Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki. 34(2). 267–281.

Chent︠s︡ov, A. G., et al.. (2024). Continuous Dependence of Sets in a Space of Measures and a Program Minimax Problem. Proceedings of the Steklov Institute of Mathematics. 325(S1). S76–S98.

Chent︠s︡ov, A. G., et al.. (2023). Minimax routing problem with a system of priority tasks. Electronic scientific archive of UrFU (Ural Federal University). 62. 96–124. 2 indexed citations

Ташлыков, О. Л., A. N. Sesekin, & A. G. Chent︠s︡ov. (2022). Development of Methods for Route Optimization of Work in Inhomogeneous Radiation Fields to Minimize the Dose Load of Personnel. Energies. 15(13). 4788–4788. 25 indexed citations

Chent︠s︡ov, A. G.. (2020). Ultrafilters as admissible generalized elements under asymptotic constraints. Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki. 30(2). 312–323. 1 indexed citations

Chent︠s︡ov, A. G., et al.. (2019). The routing problems with optimization of the starting point: dynamic programming. Electronic scientific archive of UrFU (Ural Federal University). 54. 102–121. 6 indexed citations

Chent︠s︡ov, A. G.. (2019). On the question of the optimization of permutations in the problem with dynamic constraints. Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki. 29(3). 363–381. 1 indexed citations

Chent︠s︡ov, A. G.. (2016). The Bellmann insertions in route problems with constraints and complicated cost functions. II. Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki. 26(4). 565–578. 2 indexed citations

Chent︠s︡ov, A. G., et al.. (2016). Dynamic Programming Method in a Routing Problem: a Scheme of Independent Computations. Mekhatronika Avtomatizatsiya Upravlenie. 17(12). 834–846. 5 indexed citations

10.

Chent︠s︡ov, A. G., et al.. (2016). Routization Problem Complicated by the Dependence of Costs Functions and «Current» Restrictions From the Tasks List. SHILAP Revista de lepidopterología. 23(2). 211–227. 4 indexed citations

11.

Chent︠s︡ov, A. G., et al.. (2015). About a Routing Problem of the Tool Motion on Sheet Cutting. SHILAP Revista de lepidopterología. 22(2). 278–294. 4 indexed citations

12.

Sesekin, A. N., О. Л. Ташлыков, С. Е. Щеклеин, & A. G. Chent︠s︡ov. (2014). Route optimization in the removal of radiation hazards. WIT transactions on ecology and the environment. 5 indexed citations

13.

Chent︠s︡ov, A. G., et al.. (2014). Local dynamic programming incuts in routing problems with restrictions. Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki. 56–75. 10 indexed citations

14.

Chent︠s︡ov, A. G.. (2014). Some ultrafilter properties connected with extension constructions. Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki. 87–101. 8 indexed citations

15.

Chent︠s︡ov, A. G.. (2013). To question about representation of Stone compactums. Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki. 156–174. 2 indexed citations

16.

Chent︠s︡ov, A. G.. (2012). Generalized limits and representations of attraction sets in problems with constraints of asymptotic character. Doklady Mathematics. 85(1). 83–86. 2 indexed citations

17.

Chent︠s︡ov, A. G., et al.. (2005). On a Control Problem with Incomplete Information: Quasistrategies and Control Procedures with a Model. Differential Equations. 41(12). 1727–1742. 2 indexed citations

18.

Kryazhimskiy, A.V., В. И. Максимов, Alexander Soloviev, & A. G. Chent︠s︡ov. (1996). On a probabilistic approach to a quantitative description of dynamics of natural processes. IIASA PURE (International Institute of Applied Systems Analysis).

19.

Chent︠s︡ov, A. G., et al.. (1995). A generalization of the travelling-salesman problem at “bottlenecks”. Computational Mathematics and Mathematical Physics. 35(7). 853–859. 3 indexed citations

20.

Chent︠s︡ov, A. G., et al.. (1993). An assignment problem. Computational Mathematics and Mathematical Physics. 33(4). 443–452. 6 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