Chentsov Pavel Aleksandrovich

Publications in Math-Net.Ru

1. Dynamic programming and decomposition in extreme routing problems
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 31:1 (2025),  247–272
2. Some constructions for solving routing problems using decompositions and transformations of target sets
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 34:4 (2024),  518–540
3. The routing bottlenecks problem (optimization within zones)
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 34:2 (2024),  267–285
4. Two-stage dynamic programming in the routing problem with decomposition
   
   Avtomat. i Telemekh., 2023, no. 5,  133–164
5. Optimal routing in problems of sequential traversal of megapolises in the presence of constraints
   
   Chelyab. Fiz.-Mat. Zh., 7:2 (2022),  209–233
6. An extremal two-stage routing problem and procedures based on dynamic programming
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022),  215–248
7. Dynamic programming in the routing problem: decomposition variant
   
   Russian Universities Reports. Mathematics, 27:137 (2022),  95–124
8. Some applications of optimization routing problems with additional constraints
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 32:2 (2022),  187–210
9. On sequential traversal of sets
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 31:3 (2021),  487–504
10. To the question of optimization of the starting point in the routing problem with restrictions
    
    Izv. IMI UdGU, 55 (2020),  135–154
11. On routing problem with starting point optimization
    
    Ural Math. J., 6:2 (2020),  44–62
12. The routing problems with optimization of the starting point: dynamic programming
    
    Izv. IMI UdGU, 54 (2019),  102–121
13. On one routing task with the optimization of the start–finish point
    
    Izv. IMI UdGU, 52 (2018),  103–115
14. Optimization of the start point in the GTSP with the precedence conditions
    
    Vestnik YuUrGU. Ser. Mat. Model. Progr., 11:2 (2018),  83–95
15. Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
    
    Avtomat. i Telemekh., 2017, no. 4,  106–125
16. About routing in the sheet cutting
    
    Vestnik YuUrGU. Ser. Mat. Model. Progr., 10:3 (2017),  25–39
17. Routing under constraints: problem of visit to megalopolises
    
    Avtomat. i Telemekh., 2016, no. 11,  96–117
18. About a routing problem of the tool motion on sheet cutting
    
    Model. Anal. Inform. Sist., 22:2 (2015),  278–294
19. Local dynamic programming incuts in routing problems with restrictions
    
    Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 2,  56–75
20. Elements of dynamic programming in extremal route problems
    
    Probl. Upr., 2013, no. 5,  12–21
21. On the Nonstationary Variant of Generalized Courier Problem with Interior Works
    
    Vestnik YuUrGU. Ser. Mat. Model. Progr., 6:2 (2013),  88–107
22. Dynamic programming in a nonstationary route problem
    
    Izv. IMI UdGU, 2012, no. 1(39),  151–154
23. On a Nonstationary Route Problem with Constraints
    
    Model. Anal. Inform. Sist., 19:4 (2012),  5–24
24. Distribution of assignments among participants under conditions of constraints
    
    Avtomat. i Telemekh., 2011, no. 8,  121–135
25. An extremal constrained routing problem with internal losses
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 6,  64–81
26. Iteration method in the routing problem with internal losses
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 15:4 (2009),  270–289
27. Extremal routing problem with internal losses
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 14:3 (2008),  183–201
28. Job distribution algorithms
    
    Avtomat. i Telemekh., 2006, no. 8,  77–91
29. Dynamic Programming in the Problem of Decomposition Optimization
    
    Avtomat. i Telemekh., 2002, no. 5,  133–146
30. 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