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

Number of views:
This page:614
Abstract pages:7515
Full texts:2232
References:960
Candidate of physico-mathematical sciences
E-mail: ,

https://www.mathnet.ru/eng/person48079
List of publications on Google Scholar
https://zbmath.org/authors/?q=ai:chentsov.p-a
https://mathscinet.ams.org/mathscinet/MRAuthorID/677740
https://orcid.org/0000-0003-3595-0607

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, P. A. Chentsov, “Two-stage dynamic programming in the routing problem with decomposition”, Avtomat. i Telemekh., 2023, no. 5,  133–164  mathnet; Autom. Remote Control, 84:5 (2023), 609–632
2022
3. A. A. Petunin, A. G. Chentsov, P. A. Chentsov, “Optimal routing in problems of sequential traversal of megapolises in the presence of constraints”, Chelyab. Fiz.-Mat. Zh., 7:2 (2022),  209–233  mathnet 3
4. A. G. Chentsov, P. A. Chentsov, “An extremal two-stage routing problem and procedures based on dynamic programming”, Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022),  215–248  mathnet  mathscinet  elib 4
5. A. G. Chentsov, P. A. Chentsov, “Dynamic programming in the routing problem: decomposition variant”, Russian Universities Reports. Mathematics, 27:137 (2022),  95–124  mathnet 4
6. A. A. Petunin, A. G. Chentsov, P. A. Chentsov, “Some applications of optimization routing problems with additional constraints”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 32:2 (2022),  187–210  mathnet  mathscinet  isi 1
2021
7. A. G. Chentsov, P. A. Chentsov, “On sequential traversal of sets”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 31:3 (2021),  487–504  mathnet
2020
8. A. G. Chentsov, P. A. Chentsov, “To the question of optimization of the starting point in the routing problem with restrictions”, Izv. IMI UdGU, 55 (2020),  135–154  mathnet 3
9. Alexander G. Chentsov, Pavel A. Chentsov, “On routing problem with starting point optimization”, Ural Math. J., 6:2 (2020),  44–62  mathnet  mathscinet  elib  scopus 1
2019
10. A. G. Chentsov, P. A. Chentsov, “The routing problems with optimization of the starting point: dynamic programming”, Izv. IMI UdGU, 54 (2019),  102–121  mathnet  isi  elib 5
2018
11. A. G. Chentsov, P. A. Chentsov, “On one routing task with the optimization of the start–finish point”, Izv. IMI UdGU, 52 (2018),  103–115  mathnet  elib 2
12. A. G. Chentsov, P. A. Chentsov, “Optimization of the start point in the GTSP with the precedence conditions”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 11:2 (2018),  83–95  mathnet  elib 4
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. A. Petunin, A. G. Chentsov, P. A. Chentsov, “About routing in the sheet cutting”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 10:3 (2017),  25–39  mathnet  elib 6
2016
15. A. G. Chentsov, P. A. Chentsov, “Routing under constraints: problem of visit to megalopolises”, Avtomat. i Telemekh., 2016, no. 11,  96–117  mathnet  elib; Autom. Remote Control, 77:11 (2016), 1957–1974  isi  elib  scopus 29
2015
16. A. A. Petunin, A. G. Chentsov, P. A. Chentsov, “About a routing problem of the tool motion on sheet cutting”, Model. Anal. Inform. Sist., 22:2 (2015),  278–294  mathnet  mathscinet  elib 4
2014
17. A. A. Petunin, A. G. Chentsov, P. A. Chentsov, “Local dynamic programming incuts in routing problems with restrictions”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 2,  56–75  mathnet 6
2013
18. 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
19. A. G. Chentsov, P. A. Chentsov, “On the Nonstationary Variant of Generalized Courier Problem with Interior Works”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 6:2 (2013),  88–107  mathnet
2012
20. A. G. Chentsov, P. A. Chentsov, “Dynamic programming in a nonstationary route problem”, Izv. IMI UdGU, 2012, no. 1(39),  151–154  mathnet 3
21. A. G. Chentsov, P. A. Chentsov, “On a Nonstationary Route Problem with Constraints”, Model. Anal. Inform. Sist., 19:4 (2012),  5–24  mathnet 2
2011
22. P. A. Chentsov, “Distribution of assignments among participants under conditions of constraints”, Avtomat. i Telemekh., 2011, no. 8,  121–135  mathnet  mathscinet  zmath; Autom. Remote Control, 72:8 (2011), 1690–1704  isi  scopus
2010
23. 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
2009
24. 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
25. 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
2006
26. P. A. Chentsov, “Job distribution algorithms”, Avtomat. i Telemekh., 2006, no. 8,  77–91  mathnet  mathscinet  zmath; Autom. Remote Control, 67:8 (2006), 1251–1264  scopus 3
2002
27. A. G. Chentsov, P. A. Chentsov, “Dynamic Programming in the Problem of Decomposition Optimization”, Avtomat. i Telemekh., 2002, no. 5,  133–146  mathnet  mathscinet  zmath; Autom. Remote Control, 63:5 (2002), 815–828  isi  scopus 5
2000
28. A. G. Chentsov, P. A. Chentsov, “On the construction of a procedure for partitioning a finite set, based on the dynamic programming method”, Avtomat. i Telemekh., 2000, no. 4,  129–142  mathnet  mathscinet  zmath; Autom. Remote Control, 61:4 (2000), 658–670 5

Presentations in Math-Net.Ru
1. Dynamic programming in routing problems: theory and some applications
A. G. Chentsov, P. A. Chentsov
International conference "Systems Analysis: Modeling and Control" in memory of Academician A. V. Kryazhimskiy
June 1, 2018 09:30   

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