RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Chentsov Alexander Georgievich

Statistics Math-Net.Ru
Total publications: 186
Scientific articles: 178
Presentations: 12

Number of views:
This page:3609
Abstract pages:22389
Full texts:5702
References:3613
Corresponding member of RAS
Professor
Doctor of physico-mathematical sciences (1978)
Speciality: 01.01.02 (Differential equations, dynamical systems, and optimal control)
Birth date: 4.03.1947
E-mail:
Keywords: control theory, extension of extremal problems, measure theory.
   
Main publications:
  1. Subbotin A. I., Chentsov A. G., Optimizatsiya garantii v zadachakh upravleniya, Nauka, M., 1981, 288 c.  mathscinet
  2. Chentsov A. G., Konechno-additivnye mery i relaksatsii ekstremalnykh zadach, Nauka, Ekaterinburg, 1993; angliiskoe izdanie: Chentsov A. G., Finitely additive measures and relaxations of extremal problems, Monogr. Contemp. Math., Consultants Bureau, New York, 1996, 244 pp.  mathscinet  zmath
  3. Chentsov A. G., Asymptotic attainability, Kluwer Acad. Publ., Dordrecht, 1997, 322 pp.  mathscinet  zmath
  4. Chentsov A. G., “K voprosu o korrektnom rasshirenii odnoi zadachi o vybore plotnosti veroyatnosti pri ogranicheniyakh na sistemu matematicheskikh ozhidanii”, Uspekhi matematicheskikh nauk, 50:5(305) (1995), 223–242  mathnet  mathscinet  zmath
  5. Chentsov A. G., “Finitely additive measures and extension constructions”, Atti Sem. Mat. Fis. Univ. Modena, 49:2 (2001), 531–545  mathscinet  zmath

http://www.mathnet.ru/eng/person8898
List of publications on Google Scholar
http://zbmath.org/authors/?q=ai:chentsov.alexandr-g
https://mathscinet.ams.org/mathscinet/MRAuthorID/201616

Publications in Math-Net.Ru
1. Bitopological spaces of ultrafilters and maximal linked systems
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 24:1 (2018),  257–272
2. Dynamic programming in the generalized bottleneck problem and the start point optimization
A. G. Chentsov, A. A. Chentsov, A. N. Sesekin
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:3 (2018),  348–363
3. The Wallman compactifier and its application for investigation of the abstract attainability problem
E. G. Pytkeev, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:2 (2018),  199–212
4. A problem of program maximin with constraints of asymptotic nature
A. G. Chentsov, I. I. Savenkov, Yu. V. Shapar'
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:1 (2018),  91–110
5. Optimization of the start point in the GTSP with the precedence conditions
A. G. Chentsov, P. A. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 11:2 (2018),  83–95
6. Solving a routing problem with the aid of an independent computations scheme
A. G. Chentsov, A. M. Grigoryev, A. A. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 11:1 (2018),  60–74
7. Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
A. A. Petunin, A. A. Chentsov, A. G. Chentsov, P. A. Chentsov
Avtomat. i Telemekh., 2017, no. 4,  106–125
8. A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
A. G. Chentsov, A. A. Chentsov
Izv. IMI UdGU, 50 (2017),  83–109
9. Superextension as bitopological space
A. G. Chentsov
Izv. IMI UdGU, 49 (2017),  55–79
10. Iterations of stability and the evasion problem with a constraint on the number of switchings of the formed control
A. G. Chentsov
Izv. IMI UdGU, 49 (2017),  17–54
11. Stability iterations and an evasion problem with a constraint on the number of switchings
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 23:2 (2017),  285–302
12. A discrete-continuous routing problem with precedence conditions
A. G. Chentsov, A. A. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 23:1 (2017),  275–292
13. Some representations connected with ultrafilters and maximal linked systems
Alexander G. Chentsov
Ural Math. J., 3:2 (2017),  100–121
14. On one routing problem modeling movement in radiation fields
A. G. Chentsov, A. A. Chentsov, A. M. Grigoryev
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:4 (2017),  540–557
15. Ultrafilters and maximal linked systems
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:3 (2017),  365–388
16. About routing in the sheet cutting
A. A. Petunin, A. G. Chentsov, P. A. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 10:3 (2017),  25–39
17. Routing under constraints: problem of visit to megalopolises
A. G. Chentsov, P. A. Chentsov
Avtomat. i Telemekh., 2016, no. 11,  96–117
18. Implementation of the programmed iterations method in packages of spaces
D. A. Serkov, A. G. Chentsov
Izv. IMI UdGU, 2016, no. 2(48),  42–67
19. A problem of attainability with constraints of asymptotic nature
A. G. Chentsov, A. P. Baklanov, I. I. Savenkov
Izv. IMI UdGU, 2016, no. 1(47),  54–118
20. Routization problem complicated by the dependence of costs functions and «current» restrictions from the tasks list
A. G. Chentsov, A. A. Chentsov
Model. Anal. Inform. Sist., 23:2 (2016),  211–227
21. Open ultrafilters and separability with the use of the operation of closure
E. G. Pytkeev, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  212–225
22. The program iteration method in a game problem of guidance
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 22:2 (2016),  304–321
23. Compactifiers in extension constructions for reachability problems with constraints of asymptotic nature
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 22:1 (2016),  294–309
24. The program iterations method in game problem of guidance and set-valued quasistrategies
Alexander G. Chentsov
Ural Math. J., 2:1 (2016),  17–37
25. The Bellmann insertions in route problems with constraints and complicated cost functions. II
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:4 (2016),  565–578
26. Some representations of free ultrafilters
E. G. Pytkeev, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:3 (2016),  345–365
27. The programmed iterations method in a game problem of guidance
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:2 (2016),  271–282
28. Routing of displacements with dynamic constraints: “bottleneck problem”
A. G. Chentsov, A. A. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:1 (2016),  121–140
29. The elements of the operator convexity in the construction of the programmed iteration method
D. A. Serkov, A. G. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 9:3 (2016),  82–93
30. Generalized model of courier with additional restrictions
A. A. Chentsov, A. G. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 9:1 (2016),  46–58
31. Some properties of open ultrafilters
E. G. Pytkeev, A. G. Chentsov
Izv. IMI UdGU, 2015, no. 2(46),  140–148
32. About a routing problem of the tool motion on sheet cutting
A. A. Petunin, A. G. Chentsov, P. A. Chentsov
Model. Anal. Inform. Sist., 22:2 (2015),  278–294
33. On a routing problem with constraints that include dependence on a task list
M. S. Kosheleva, A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 21:4 (2015),  178–195
34. An exact algorithm with linear complexity for a problem of visiting megalopolises
A. G. Chentsov, M. Yu. Khachai, M. Yu. Khachai
Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  309–317
35. An abstract reachability problem: “purely asymptotic” version
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 21:2 (2015),  289–305
36. On an asymptotic analysis problem related to the construction of an attainability domain
A. G. Chentsov, A. P. Baklanov
Tr. Mat. Inst. Steklova, 291 (2015),  292–311
37. Programmed iteration method and operator convexity in an abstract retention problem
D. A. Serkov, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 25:3 (2015),  348–366
38. To question about realization of attraction elements in abstract attainability problems
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 25:2 (2015),  212–229
39. On extension of the maximin problem
A. G. Chentsov, Yu. V. Shapar'
Avtomat. i Telemekh., 2014, no. 7,  155–174
40. Problem of successive megalopolis traversal with the precedence conditions
A. G. Chentsov
Avtomat. i Telemekh., 2014, no. 4,  170–190
41. Some topological structures of extensions of abstract reachability problems
A. G. Chentsov, E. G. Pytkeev
Trudy Inst. Mat. i Mekh. UrO RAN, 20:4 (2014),  312–329
42. On the question of construction of an attraction set under constraints of asymptotic nature
A. G. Chentsov, A. P. Baklanov
Trudy Inst. Mat. i Mekh. UrO RAN, 20:3 (2014),  309–323
43. On the structure of ultrafilters and properties related to convergence in topological spaces
E. G. Pytkeev, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  250–267
44. Ultrafilters of measurable spaces and their application in extension constructions
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 20:1 (2014),  285–304
45. The Bellmann insertions in the route problem with constraints and complicated cost functions
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 4,  122–141
46. To the validity of constraints in the class of generalized elements
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 3,  90–109
47. Local dynamic programming incuts in routing problems with restrictions
A. A. Petunin, A. G. Chentsov, P. A. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 2,  56–75
48. Some ultrafilter properties connected with extension constructions
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 1,  87–101
49. On certain problems of the structure of ultrafilters related to extensions of abstract control problems
A. G. Chentsov
Avtomat. i Telemekh., 2013, no. 12,  119–139
50. Attraction sets in abstract attainability problems: equivalent representations and basic properties
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2013, no. 11,  33–50
51. Elements of dynamic programming in extremal route problems
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov
Probl. Upr., 2013, no. 5,  12–21
52. On the question of representation of ultrafilters and their application in extension constructions
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 19:4 (2013),  289–307
53. On the question of representation of ultrafilters in a product of measurable spaces
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  307–319
54. To question about representation of Stone compactums
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 4,  156–174
55. The iterations method in generalized courier problem with singularity in the definition of cost functions
A. A. Chentsov, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 3,  88–113
56. To question of routing of works complexes
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 1,  59–82
57. On the Nonstationary Variant of Generalized Courier Problem with Interior Works
A. G. Chentsov, P. A. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 6:2 (2013),  88–107
58. On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
A. G. Chentsov
Avtomat. i Telemekh., 2012, no. 3,  134–149
59. Dynamic programming in a nonstationary route problem
A. G. Chentsov, P. A. Chentsov
Izv. IMI UdGU, 2012, no. 1(39),  151–154
60. To the question about structure of attraction set in a topological space
A. G. Chentsov
Izv. IMI UdGU, 2012, no. 1(39),  147–150
61. Representation of attraction elements in abstract attainability problems with asymptotic constraints
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2012, no. 10,  45–59
62. On a Nonstationary Route Problem with Constraints
A. G. Chentsov, P. A. Chentsov
Model. Anal. Inform. Sist., 19:4 (2012),  5–24
63. Tier mappings and ultrafilter-based transformations
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 18:4 (2012),  298–314
64. On an iterative procedure for solving a routing problem with constraints
A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  261–281
65. On a routing problem with internal tasks
A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 18:1 (2012),  298–317
66. About an example of the attraction set construction with employment of Stone space
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, no. 4,  108–124
67. The transformation of ultrafilters and their application in constructions of attraction sets
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, no. 3,  85–102
68. About one route problem with interior works
I. B. Cheblokov, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, no. 1,  96–119
69. A Parallel Procedure of Constructing Bellman Function in the Generalized Courier Problem with Interior Works
A. G. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 2012, no. 12,  53–76
70. On approximate constraint satisfaction
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2011, no. 2,  86–102
71. Dynamic programming in a generalized courier problem with inner tasks: elements of a parallel structure
A. M. Grigoriev, E. E. Ivanko, A. G. Chentsov
Model. Anal. Inform. Sist., 18:3 (2011),  101–124
72. On one example of representing the ultrafilter space for an algebra of sets
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 17:4 (2011),  293–311
73. One representation of the results of action of approximate solutions in a problem with constraints of asymptotic nature
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 17:2 (2011),  225–239
74. Ultrafilters of measurable spaces as generalized solutions in abstract attainability problems
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 17:1 (2011),  268–293
75. About correctness of some problems of control by material point
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2011, no. 3,  127–141
76. Filters and ultrafilters in the constructions of attraction sets
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2011, no. 1,  113–142
77. On a generalization of one game control problem in the class of finitely additive measures
A. G. Chentsov, Yu. V. Shapar'
Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 7,  86–102
78. An extremal constrained routing problem with internal losses
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 6,  64–81
79. To the question about stability of attainability domain in abstract problem with constraints of the moment character
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 16:5 (2010),  205–212
80. Routing with an abstract function of travel cost aggregation
A. N. Sesekin, A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010),  240–264
81. One bottleneck routing problem
A. N. Sesekin, A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 16:1 (2010),  152–170
82. On obeying constraints of asymptotic character
A. G. Chentsov
Tr. Mat. Inst. Steklova, 271 (2010),  59–75
83. About presentation of maximin in the game problem with constraints of asymptotic character
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, no. 3,  104–119
84. To the question about precise and approximate validity in abstract control problem
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, no. 2,  29–48
85. Finitely additive measures and extensions of the game problems with constraints of asymptotic character
A. G. Chentsov, Yu. V. Shapar'
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, no. 1,  89–111
86. Iteration method in the routing problem with internal losses
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 15:4 (2009),  270–289
87. On the result equivalence of constraints of asymptotic nature
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 15:3 (2009),  241–261
88. Some properties of the operator of the measure extension
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2009, no. 3,  114–127
89. Extensions in the class of finitely additive measures and conditions of asymptotic non-sensitivity under a weakening of the part of constraints
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2009, no. 1,  131–152
90. Quasistrategies in an abstract guidance control problem
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 10,  55–69
91. Extension of the abstract attainability problem using the Stone representation space
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 3,  63–75
92. Extremal routing problem with internal losses
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 14:3 (2008),  183–201
93. Extremal bottleneck routing problem with constraints in the form of precedence conditions
A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  129–142
94. The space of Stone representation and constructions of extensions
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2008, no. 2,  169–172
95. Construction of limiting process operations using ultrafilters of measurable spaces
A. G. Chentsov
Avtomat. i Telemekh., 2007, no. 11,  208–222
96. Generalized elements in problem on asymptotic attainability
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2007, no. 11,  56–70
97. О реализации метода динамического программирования в обобщенной задаче курьера
A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 13:3 (2007),  136–160
98. Extensions of abstract problems of attainability: Nonsequential version
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 13:2 (2007),  184–217
99. Certain problems of asymptotic analysis and extensions. II
A. G. Chentsov
Avtomat. i Telemekh., 2006, no. 1,  128–145
100. Extreme problems of routing with restrictions
A. G. Chentsov
Izv. IMI UdGU, 2006, no. 3(37),  163–166
101. On the compactification of a pencil of trajectories of an abstract control system
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 5,  55–66
102. Nonsequential approximate solutions in abstract problems of attainability
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 12:1 (2006),  216–241
103. On the structure of an extremal problem of rout optimization with constraints in the form of precedence conditions
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat., 2006, no. 1,  127–150
104. Certain problems of asymptotic analysis and extensions. I
A. G. Chentsov
Avtomat. i Telemekh., 2005, no. 12,  125–142
105. On a Control Problem with Incomplete Information: Quasistrategies and Control Procedures with a Model
D. V. Khlopin, A. G. Chentsov
Differ. Uravn., 41:12 (2005),  1652–1666
106. On a representation of a pencil of admissible trajectories in a linear control problem with an impulse constraint
T. Yu. Kashirtseva, A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 12,  15–27
107. Quasistrategies in an abstract control problem and the method of programmed iterations (a direct version)
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 11,  53–65
108. Approximate solutions in the problem of asymptotic attainability
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 8,  63–73
109. An abstract confinement problem: a programmed iterations method of solution
A. G. Chentsov
Avtomat. i Telemekh., 2004, no. 2,  157–169
110. On the construction of an asymptotic analog of a pencil of trajectories for a linear system with a single-impulse control
A. V. Skvortsova, A. G. Chentsov
Differ. Uravn., 40:12 (2004),  1645–1657
111. Generalized attraction sets and approximate solutions forming them
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 10:2 (2004),  178–196
112. A Version of the Program Iteration Method
A. G. Chentsov
Differ. Uravn., 39:8 (2003),  1076–1086
113. Недираковские $(0,1)$-меры и $\sigma$-топологические пространства
A. G. Chentsov
Vestnik Chelyabinsk. Gos. Univ., 2003, no. 8,  190–202
114. On Solution of the Problem of Successive Round of Sets by the “Nonclosed” Travelling Salesman Problem
A. A. Chentsov, A. G. Chentsov
Avtomat. i Telemekh., 2002, no. 11,  151–166
115. Dynamic Programming in the Problem of Decomposition Optimization
A. G. Chentsov, P. A. Chentsov
Avtomat. i Telemekh., 2002, no. 5,  133–146
116. Some questions of the structure of the programmed iterations method
A. G. Chentsov
Fundam. Prikl. Mat., 8:3 (2002),  921–942
117. On the construction of correct extensions in the class of finitely additive measures
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2002, no. 2,  58–80
118. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: II
A. G. Chentsov
Differ. Uravn., 37:5 (2001),  679–688
119. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: I
A. G. Chentsov
Differ. Uravn., 37:4 (2001),  470–480
120. On the duality of various versions of the programmed iteration method
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2001, no. 12,  77–88
121. Reduction of route optimization problems
A. A. Chentsov, A. G. Chentsov
Avtomat. i Telemekh., 2000, no. 10,  136–150
122. On the construction of a procedure for partitioning a finite set, based on the dynamic programming method
A. G. Chentsov, P. A. Chentsov
Avtomat. i Telemekh., 2000, no. 4,  129–142
123. On the iterative realization of nonanticipating multivalued mappings
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 3,  66–76
124. Universal version of generalized integral constraints in the class of finitely additive measures. II
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 2,  69–77
125. Topological constructions of extensions and representations of attraction sets
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 6:1 (2000),  247–276
126. Well-posed extensions of unstable control problems with integral constraints
A. G. Chentsov
Izv. RAN. Ser. Mat., 63:3 (1999),  185–223
127. Universal version of generalized integral constraints in the class of finitely additive measures. I
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 7,  67–74
128. An Iterative Procedure for Constructing Minimax and Viscosity Solutions to the Hamilton–Jacobi Equations and Its Generalization
A. I. Subbotin, A. G. Chentsov
Tr. Mat. Inst. Steklova, 224 (1999),  311–334
129. On the solution of the route optimization problem by the dynamic programming method
A. A. Chentsov, A. G. Chentsov
Avtomat. i Telemekh., 1998, no. 9,  117–129
130. The universal asymptotic realization of integral constraints and constructions of extension in the class of finitely additive measures
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 5 (1998),  328–356
131. On extension of stochastic constraints in the class of finitely additive probabilities
N. M. Loginova, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 5 (1998),  277–300
132. To the Routing of Connections
L. N. Korotaeva, M. P. Trukhin, A. G. Chentsov
Avtomat. i Telemekh., 1997, no. 12,  175–192
133. An Extension of Control Problem in the Class of Vector Finitely Additive Measures
S. I. Morina, A. G. Chentsov
Avtomat. i Telemekh., 1997, no. 7,  207–216
134. The program iteration method in the class of finitely additive control measures
A. G. Chentsov
Differ. Uravn., 33:11 (1997),  1528–1536
135. On extension of stochastic constraints in the class of finite-additive probabilities
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 6,  57–69
136. On a Problem of Route Optimization and Its Applications
B. B. Zobnin, L. N. Korotaeva, A. G. Chentsov
Probl. Peredachi Inf., 33:4 (1997),  70–87
137. On a construction of an extension of an abstract, purely pulse control problem
V. I. Kuznetsov, A. G. Chentsov
Zh. Vychisl. Mat. Mat. Fiz., 37:5 (1997),  524–532
138. Finitely additive vector measures and the regularization questions in the problem about constructing of the sets of asymptotic attainability
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 4 (1996),  266–295
139. On correct extension of some stochastically constrained problems
A. G. Chentsov
Avtomat. i Telemekh., 1995, no. 7,  68–79
140. The problem of constructing sets of asymptotic attainability and its regularization
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 10,  61–75
141. Asymptotic attainability with perturbation of integral constraints in an abstract control problem. II
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 3,  62–73
142. Asymptotic attainability with perturbation of integral constraints in an abstract control problem. I
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 2,  60–71
143. On the correct extension of a problem of selecting the probability density under constraints on a system of mathematical expectations
A. G. Chentsov
Uspekhi Mat. Nauk, 50:5(305) (1995),  223–242
144. The asymptotically attainable elements and their generalized representation in class of finitely additive measures
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 3 (1995),  211–244
145. Asymptotically attainable elements: Generalized constructions and the realization in the class of approximate solutions
A. G. Chentsov
Trudy Mat. Inst. Steklov., 211 (1995),  443–456
146. On a generalization of the bottleneck traveling salesman problem
L. N. Korotaeva, A. G. Chentsov
Zh. Vychisl. Mat. Mat. Fiz., 35:7 (1995),  1067–1076
147. Dynamic programming in the problem of covering optimization
K. G. Sabiryanova, A. G. Chentsov
Avtomat. i Telemekh., 1994, no. 3,  54–64
148. On the regularization of the function of the asymptotic value of a control problem under perturbation of the set of initial positions
V. E. Pak, A. G. Chentsov
Differ. Uravn., 30:11 (1994),  1939–1948
149. On a programmed linear game-theoretic guidance problem with constraints on the control force impulse
V. P. Serov, A. G. Chentsov
Avtomat. i Telemekh., 1993, no. 5,  61–74
150. Asymptotically admissible elements: insensitivity to disturbance of some of the conditions and physical realizability
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1993, no. 5,  112–123
151. An assignment problem
L. N. Korotaeva, È. M. Nazarov, A. G. Chentsov
Zh. Vychisl. Mat. Mat. Fiz., 33:4 (1993),  483–494
152. Stability of some nonlinear extremal problems with actions of an impulse nature
A. G. Chentsov
Avtomat. i Telemekh., 1992, no. 5,  30–41
153. On a regularization procedure for a function of the value of a nonlinear control problem
V. E. Pak, A. G. Chentsov
Differ. Uravn., 28:3 (1992),  414–422
154. Relaxation of constraints in multi-objective problems
E. G. Belov, A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 7,  3–8
155. On the asymptotic equivalence of relaxations of extremal problems
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 6,  53–60
156. On decomposition of the process of successive choice of variants
L. T. Buslaeva, A. G. Chentsov
Matem. Mod., 3:4 (1991),  103–113
157. On a construction of an extension of a control problem with integral constraints
V. P. Serov, A. G. Chentsov
Differ. Uravn., 26:4 (1990),  607–618
158. Discrete-time control in mathematical programming problems dual to successive adaptation problems
S. I. Morina, A. G. Chentsov
Avtomat. i Telemekh., 1989, no. 2,  47–56
159. Some topological properties of generalized solutions of nonlinear control systems
V. E. Pak, A. G. Chentsov
Differ. Uravn., 25:11 (1989),  2004–2005
160. A modification of the dynamic programming method for the travelling-salesman problem
L. N. Korotaeva, A. N. Sesekin, A. G. Chentsov
Zh. Vychisl. Mat. Mat. Fiz., 29:8 (1989),  1107–1113
161. Duality and dynamic programming in the control of simple motion
È. M. Nazarov, A. G. Chentsov
Zh. Vychisl. Mat. Mat. Fiz., 29:4 (1989),  614–616
162. Certain properties of two-valued measures and the conditions of universal integrability
E. G. Belov, A. G. Chentsov
Mat. Zametki, 42:2 (1987),  288–297
163. On the control of discrete systems in an infinite time interval
V. M. Ivanov, A. G. Chentsov
Zh. Vychisl. Mat. Mat. Fiz., 27:12 (1987),  1780–1789
164. Optimal performance of specified motions of a linear discrete system with bounded resources
A. N. Sesekin, A. G. Chentsov
Avtomat. i Telemekh., 1986, no. 6,  56–61
165. On the question of universal integrability of bounded functions
A. G. Chentsov
Mat. Sb. (N.S.), 131(173):1(9) (1986),  73–93
166. A class of linear differential games with a constraint on the number of switchings
V. P. Dyatlov, A. G. Chentsov
Differ. Uravn., 20:8 (1984),  1442
167. A linear differential game of approach with a nonconvex target set
V. Ya. Ruzakov, A. G. Chentsov
Differ. Uravn., 20:4 (1984),  593–597
168. On an alternative in a class of quasistrategies for a differential approach-evasion game
A. G. Chentsov
Differ. Uravn., 16:10 (1980),  1801–1808
169. A class of differential games in mixed strategies
V. Ya. Ruzakov, A. G. Chentsov
Differ. Uravn., 16:10 (1980),  1794–1800
170. On the game problem of convergence at a given moment of time
A. G. Chentsov
Izv. Akad. Nauk SSSR Ser. Mat., 42:2 (1978),  455–467
171. On a game problem of guidance
A. G. Chentsov
Dokl. Akad. Nauk SSSR, 226:1 (1976),  73–76
172. Maximin deviation in a differential game
A. G. Chentsov
Differ. Uravn., 12:5 (1976),  848–856
173. On a game problem of converging at a given instant of time
A. G. Chentsov
Mat. Sb. (N.S.), 99(141):3 (1976),  394–420
174. The structure of a certain game-theoretic approach problem
A. G. Chentsov
Dokl. Akad. Nauk SSSR, 224:6 (1975),  1272–1275
175. A condition for a maximin in a game problem of programmed control
A. G. Chentsov
Dokl. Akad. Nauk SSSR, 221:1 (1975),  48–51
176. A certain approximation of a differential game in mixed strategies
V. D. Batukhtin, A. G. Chentsov
Differ. Uravn., 11:10 (1975),  1732–1737
177. On a programmed construction in a positional differential game
V. D. Batukhtin, A. G. Chentsov
Izv. Akad. Nauk SSSR Ser. Mat., 39:4 (1975),  926–936
178. On stability conditions for a differential game
A. G. Chentsov
Dokl. Akad. Nauk SSSR, 215:4 (1974),  800–803
179. On a game problem of programmed control
A. G. Chentsov
Dokl. Akad. Nauk SSSR, 213:2 (1973),  289–292

180. In memory of Arkady Viktorovich Kryazhimskiy (1949-2014)
Sergei M. Aseev, Alexander G. Chentsov, Alexey A. Davydov, Nikolai L. Grigorenko, Vyacheslav I. Maksimov, Elena A. Rovenskaya, Alexander M. Tarasiev
Ural Math. J., 2:2 (2016),  3–15
181. A model of “nonadditive” routing problem where the costs depend on the set of pending tasks
A. G. Chentsov, Ya. V. Salii
Vestnik YuUrGU. Ser. Mat. Model. Progr., 8:1 (2015),  24–45
182. Ivan Ivanovich Eremin
V. I. Berdyshev, V. V. Vasin, S. V. Matveev, A. A. Makhnev, Yu. N. Subbotin, N. N. Subbotina, V. N. Ushakov, M. Yu. Khachai, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  5–12
183. In memory of Evgenii Leonidovich Tonkov (27.06.1940–28.09.2014)
I. V. Gaishun, A. A. Gryzlov, V. Ya. Derr, N. A. Izobov, A. I. Karpov, E. K. Makarov, G. V. Merzlyakova, N. N. Petrov, S. N. Popova, L. I. Rodina, N. Kh. Rozov, I. N. Sergeev, A. A. Tolstonogov, V. N. Ushakov, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 4,  146–154
184. In memory of Nikolai Nikolaevich Krasovskii (07.09.1924 – 04.04.2012)
N. N. Petrov, E. L. Tonkov, V. N. Ushakov, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, no. 3,  157–158
185. To the 75th anniversary of academician of Russian Academy of Sciences Yu. S. Osipov
N. N. Krasovskii, I. I. Eremin, A. M. Il'in, A. V. Kryazhimskii, A. B. Kurzhanskii, V. I. Berdyshev, V. V. Vasin, A. A. Makhnev, S. V. Matveev, Yu. N. Subbotin, A. G. Chentsov, V. N. Ushakov, V. V. Kabanov, V. I. Maksimov
Trudy Inst. Mat. i Mekh. UrO RAN, 17:2 (2011),  5–6
186. Aleksandr Borisovich Kurzhanskii (on the occasion of his 70th birthday)
V. I. Berdyshev, M. I. Gusev, N. N. Krasovskii, Yu. S. Osipov, V. N. Ushakov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 15:4 (2009),  5–9
187. Andrei Izmailovich Subbotin (Memorial issue)
V. N. Ushakov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 6:1 (2000),  3–26

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   
2. Opening of the Conference
N. L. Grigorenko, E. I. Moiseev, A. D. Gvishiani, E. A. Rovenskaya, S. M. Aseev, A. M. Tarasyev, A. A. Davydov, V. I. Maksimov, A. G. Chentsov
International conference "Systems Analysis: Modeling and Control" in memory of Academician A. V. Kryazhimskiy
May 31, 2018 09:30   
3. The programmed iterations method and the set of positional absorption in a guidance–evasion differential game
A. G. Chentsov
International Conference "Mathematical Theory of Optimal Control" dedicated to the 90th birthday of Academician R. V. Gamkrelidze
June 1, 2017 16:50   
4. The programmed iterations method and evasion problem with constraints on the number of control switchings
A. G. Chentsov
International conference "Dynamical Systems: Inverse Problems, Stability and Control Processes" dedicated to the 80th birthday of Yu. S. Osipov
September 23, 2016 12:50   
5. Programmed iteration method for the problem of feedback absorption set design
A. G. Chentsov
Seminar of Control System Department
April 7, 2016 12:00
6. 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
7. Design of attainability set for the control problem in the class if narrow implulses
A. G. Chentsov, A. P. Baklanov,
Seminar of Control System Department
October 8, 2015 12:00
8. A construction of extension of topological spaces in the class of ultafilters
E. G. Pytkeev, A. G. Chentsov
Seminar of Control System Department
June 18, 2015 12:00
9. Discrete optimization
A. G. Chentsov
Seminar of Control System Department
May 21, 2015 12:00
10. A model of «nonadditive» routing problem where the costs depend on the set of pending tasks
A. G. Chentsov, Ya. V. Salii
Seminar of Control System Department
December 18, 2014
11. An extension of abstract attainability problem under asymptotic constrains
A. G. Chentsov, A. P. Baklanov
Seminar of Control System Department
December 11, 2014
12. Constructions of relaxations in the class of ultrafilters of measurable spaces
A. G. Chentsov
Seminar of Control System Department
March 20, 2014 15:00

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018