Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Chentsov, Aleksei Aleksandrovich
Statistics Math-Net.Ru
Total publications: 34
Scientific articles: 34
Presentations: 1

Number of views:
This page:989
Abstract pages:10141
Full texts:3808
References:1563
Candidate of physico-mathematical sciences
E-mail: ,

https://www.mathnet.ru/eng/person48061
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru Citations
2024
1. A. G. Chentsov, A. A. Chentsov, P. A. Chentsov, “The routing bottlenecks problem (optimization within zones)”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 34:2 (2024),  267–285  mathnet
2023
2. A. G. Chentsov, A. A. Chentsov, “Minimax routing problem with a system of priority tasks”, Izv. IMI UdGU, 62 (2023),  96–124  mathnet 1
3. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “On the application of the minimax traveling salesman problem in aviation logistics”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 16:3 (2023),  20–34  mathnet
2022
4. A. G. Chentsov, A. A. Chentsov, “Dynamic programming and questions of solvability of route bottleneck problem with resource constraints”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 32:4 (2022),  569–592  mathnet  mathscinet 4
5. A. G. Chentsov, A. A. Chentsov, “On one routing problem oriented on the problem of dismantling radiation-hazardous objects”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 15:3 (2022),  83–95  mathnet 1
2021
6. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “One task of routing jobs in high radiation conditions”, Izv. IMI UdGU, 58 (2021),  94–126  mathnet 2
2020
7. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks”, Trudy Inst. Mat. i Mekh. UrO RAN, 26:3 (2020),  219–234  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 315, suppl. 1 (2021), S67–S80  isi  scopus 4
8. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “On one routing problem with non-additive cost aggregation”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 13:1 (2020),  64–80  mathnet 2
2019
9. A. G. Chentsov, A. A. Chentsov, “On the question of the optimization of permutations in the problem with dynamic constraints”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:3 (2019),  363–381  mathnet
2018
10. Alexander G. Chentsov, Alexey M. Grigoriev, Alexey A. Chentsov, “Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions”, Ural Math. J., 4:2 (2018),  43–55  mathnet  mathscinet  elib 1
11. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “Dynamic programming in the generalized bottleneck problem and the start point optimization”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:3 (2018),  348–363  mathnet  elib 6
12. A. G. Chentsov, A. M. Grigoryev, A. A. Chentsov, “Solving a routing problem with the aid of an independent computations scheme”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 11:1 (2018),  60–74  mathnet  elib 5
2017
13. A. A. Petunin, A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints”, Avtomat. i Telemekh., 2017, no. 4,  106–125  mathnet  elib; Autom. Remote Control, 78:4 (2017), 666–681  isi  scopus 5
14. A. G. Chentsov, A. A. Chentsov, “A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)”, Izv. IMI UdGU, 50 (2017),  83–109  mathnet  elib 9
15. A. G. Chentsov, A. A. Chentsov, “A discrete-continuous routing problem with precedence conditions”, Trudy Inst. Mat. i Mekh. UrO RAN, 23:1 (2017),  275–292  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 300, suppl. 1 (2018), 56–71  isi  scopus 5
16. A. G. Chentsov, A. A. Chentsov, A. M. Grigoryev, “On one routing problem modeling movement in radiation fields”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:4 (2017),  540–557  mathnet  elib 2
2016
17. A. G. Chentsov, A. A. Chentsov, “Routization problem complicated by the dependence of costs functions and «current» restrictions from the tasks list”, Model. Anal. Inform. Sist., 23:2 (2016),  211–227  mathnet  mathscinet  elib 2
18. A. G. Chentsov, A. A. Chentsov, “Routing of displacements with dynamic constraints: “bottleneck problem””, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:1 (2016),  121–140  mathnet  mathscinet  elib 8
19. A. A. Chentsov, A. G. Chentsov, “Generalized model of courier with additional restrictions”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 9:1 (2016),  46–58  mathnet  elib
2015
20. M. S. Kosheleva, A. A. Chentsov, A. G. Chentsov, “On a routing problem with constraints that include dependence on a task list”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:4 (2015),  178–195  mathnet  mathscinet  elib 5
2013
21. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in extremal route problems”, Probl. Upr., 2013, no. 5,  12–21  mathnet; Automation and Remote Control, 75:3 (2014), 537–550  isi 14
22. A. A. Chentsov, A. G. Chentsov, “The iterations method in generalized courier problem with singularity in the definition of cost functions”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 3,  88–113  mathnet
2012
23. A. A. Chentsov, A. G. Chentsov, “On an iterative procedure for solving a routing problem with constraints”, Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  261–281  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 283, suppl. 1 (2013), 24–45  isi  scopus 2
24. A. A. Chentsov, A. G. Chentsov, “On a routing problem with internal tasks”, Trudy Inst. Mat. i Mekh. UrO RAN, 18:1 (2012),  298–317  mathnet  elib 1
2010
25. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “An extremal constrained routing problem with internal losses”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 6,  64–81  mathnet  mathscinet; Russian Math. (Iz. VUZ), 54:6 (2010), 54–68  scopus 17
26. A. N. Sesekin, A. A. Chentsov, A. G. Chentsov, “Routing with an abstract function of travel cost aggregation”, Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010),  240–264  mathnet  elib 5
27. A. N. Sesekin, A. A. Chentsov, A. G. Chentsov, “One bottleneck routing problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 16:1 (2010),  152–170  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S165–S185  isi  scopus 3
2009
28. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Iteration method in the routing problem with internal losses”, Trudy Inst. Mat. i Mekh. UrO RAN, 15:4 (2009),  270–289  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 269, suppl. 1 (2010), S48–S68  scopus 8
2008
29. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Extremal routing problem with internal losses”, Trudy Inst. Mat. i Mekh. UrO RAN, 14:3 (2008),  183–201  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 264, suppl. 1 (2009), S87–S106  isi  scopus 15
30. A. A. Chentsov, A. G. Chentsov, “Extremal bottleneck routing problem with constraints in the form of precedence conditions”, Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  129–142  mathnet  zmath  elib; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S23–S36  isi  scopus 8
2007
31. A. A. Chentsov, A. G. Chentsov, “О реализации метода динамического программирования в обобщенной задаче курьера”, Trudy Inst. Mat. i Mekh. UrO RAN, 13:3 (2007),  136–160  mathnet  elib 8
2002
32. A. A. Chentsov, A. G. Chentsov, “On Solution of the Problem of Successive Round of Sets by the “Nonclosed” Travelling Salesman Problem”, Avtomat. i Telemekh., 2002, no. 11,  151–166  mathnet  mathscinet  zmath; Autom. Remote Control, 63:11 (2002), 1832–1845  isi  scopus 10
2000
33. A. A. Chentsov, A. G. Chentsov, “Reduction of route optimization problems”, Avtomat. i Telemekh., 2000, no. 10,  136–150  mathnet  mathscinet  zmath; Autom. Remote Control, 61:10 (2000), 1708–1722 6
1998
34. A. A. Chentsov, A. G. Chentsov, “On the solution of the route optimization problem by the dynamic programming method”, Avtomat. i Telemekh., 1998, no. 9,  117–129  mathnet  mathscinet  zmath; Autom. Remote Control, 59:9 (1998), 1299–1307 6

Presentations in Math-Net.Ru
1. Routing with conditions depending on the list of tasks
A. A. Chentsov, A. G. Chentsov
Seminar of Control System Department
November 5, 2015 12:00

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024