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

Statistics Math-Net.Ru
Total publications: 175
Scientific articles: 167
Presentations: 10

Number of views:
This page:3153
Abstract pages:18083
Full texts:4568
References:2569
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
http://www.ams.org/mathscinet/search/author.html?return=viewitems&mrauthid=201616

Publications in Math-Net.Ru
1. 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
2. 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
3. Superextension as bitopological space
A. G. Chentsov
Izv. IMI UdGU, 49 (2017),  55–79
4. 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
5. 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
6. 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
7. Some representations connected with ultrafilters and maximal linked systems
Alexander G. Chentsov
Ural Math. J., 3:2 (2017),  100–121
8. 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
9. Ultrafilters and maximal linked systems
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:3 (2017),  365–388
10. 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
11. Routing under constraints: problem of visit to megalopolises
A. G. Chentsov, P. A. Chentsov
Avtomat. i Telemekh., 2016, no. 11,  96–117
12. 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
13. 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
14. 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
15. 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
16. 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
17. 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
18. The program iterations method in game problem of guidance and set-valued quasistrategies
Alexander G. Chentsov
Ural Math. J., 2:1 (2016),  17–37
19. 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
20. Some representations of free ultrafilters
E. G. Pytkeev, A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:3 (2016),  345–365
21. 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
22. 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
23. 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
24. Generalized model of courier with additional restrictions
A. A. Chentsov, A. G. Chentsov
Vestnik YuUrGU. Ser. Mat. Model. Progr., 9:1 (2016),  46–58
25. Some properties of open ultrafilters
E. G. Pytkeev, A. G. Chentsov
Izv. IMI UdGU, 2015, no. 2(46),  140–148
26. 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
27. 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
28. 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
29. An abstract reachability problem: “purely asymptotic” version
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 21:2 (2015),  289–305
30. 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
31. 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
32. 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
33. On extension of the maximin problem
A. G. Chentsov, Yu. V. Shapar'
Avtomat. i Telemekh., 2014, no. 7,  155–174
34. Problem of successive megalopolis traversal with the precedence conditions
A. G. Chentsov
Avtomat. i Telemekh., 2014, no. 4,  170–190
35. 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
36. 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
37. 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
38. 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
39. 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
40. 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
41. 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
42. Some ultrafilter properties connected with extension constructions
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, no. 1,  87–101
43. 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
44. Attraction sets in abstract attainability problems: equivalent representations and basic properties
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2013, no. 11,  33–50
45. Elements of dynamic programming in extremal route problems
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov
Probl. Upr., 2013, no. 5,  12–21
46. 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
47. 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
48. To question about representation of Stone compactums
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 4,  156–174
49. 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
50. To question of routing of works complexes
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 1,  59–82
51. 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
52. 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
53. Dynamic programming in a nonstationary route problem
A. G. Chentsov, P. A. Chentsov
Izv. IMI UdGU, 2012, no. 1(39),  151–154
54. To the question about structure of attraction set in a topological space
A. G. Chentsov
Izv. IMI UdGU, 2012, no. 1(39),  147–150
55. Representation of attraction elements in abstract attainability problems with asymptotic constraints
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2012, no. 10,  45–59
56. On a Nonstationary Route Problem with Constraints
A. G. Chentsov, P. A. Chentsov
Model. Anal. Inform. Sist., 19:4 (2012),  5–24
57. Tier mappings and ultrafilter-based transformations
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 18:4 (2012),  298–314
58. 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
59. 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
60. 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
61. 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
62. 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
63. 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
64. On approximate constraint satisfaction
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2011, no. 2,  86–102
65. 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
66. 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
67. 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
68. 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
69. 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
70. Filters and ultrafilters in the constructions of attraction sets
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2011, no. 1,  113–142
71. 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
72. 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
73. 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
74. 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
75. 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
76. On obeying constraints of asymptotic character
A. G. Chentsov
Tr. Mat. Inst. Steklova, 271 (2010),  59–75
77. 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
78. 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
79. 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
80. 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
81. On the result equivalence of constraints of asymptotic nature
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 15:3 (2009),  241–261
82. Some properties of the operator of the measure extension
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2009, no. 3,  114–127
83. 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
84. Quasistrategies in an abstract guidance control problem
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 10,  55–69
85. Extension of the abstract attainability problem using the Stone representation space
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2008, no. 3,  63–75
86. 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
87. 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
88. The space of Stone representation and constructions of extensions
A. G. Chentsov
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2008, no. 2,  169–172
89. Construction of limiting process operations using ultrafilters of measurable spaces
A. G. Chentsov
Avtomat. i Telemekh., 2007, no. 11,  208–222
90. Generalized elements in problem on asymptotic attainability
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2007, no. 11,  56–70
91. О реализации метода динамического программирования в обобщенной задаче курьера
A. A. Chentsov, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 13:3 (2007),  136–160
92. Extensions of abstract problems of attainability: Nonsequential version
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 13:2 (2007),  184–217
93. Certain problems of asymptotic analysis and extensions. II
A. G. Chentsov
Avtomat. i Telemekh., 2006, no. 1,  128–145
94. Extreme problems of routing with restrictions
A. G. Chentsov
Izv. IMI UdGU, 2006, no. 3(37),  163–166
95. 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
96. Nonsequential approximate solutions in abstract problems of attainability
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 12:1 (2006),  216–241
97. 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
98. Certain problems of asymptotic analysis and extensions. I
A. G. Chentsov
Avtomat. i Telemekh., 2005, no. 12,  125–142
99. 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
100. 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
101. 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
102. Approximate solutions in the problem of asymptotic attainability
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2005, no. 8,  63–73
103. An abstract confinement problem: a programmed iterations method of solution
A. G. Chentsov
Avtomat. i Telemekh., 2004, no. 2,  157–169
104. 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
105. Generalized attraction sets and approximate solutions forming them
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 10:2 (2004),  178–196
106. A Version of the Program Iteration Method
A. G. Chentsov
Differ. Uravn., 39:8 (2003),  1076–1086
107. 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
108. Dynamic Programming in the Problem of Decomposition Optimization
A. G. Chentsov, P. A. Chentsov
Avtomat. i Telemekh., 2002, no. 5,  133–146
109. Some questions of the structure of the programmed iterations method
A. G. Chentsov
Fundam. Prikl. Mat., 8:3 (2002),  921–942
110. 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
111. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: II
A. G. Chentsov
Differ. Uravn., 37:5 (2001),  679–688
112. Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: I
A. G. Chentsov
Differ. Uravn., 37:4 (2001),  470–480
113. On the duality of various versions of the programmed iteration method
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2001, no. 12,  77–88
114. Reduction of route optimization problems
A. A. Chentsov, A. G. Chentsov
Avtomat. i Telemekh., 2000, no. 10,  136–150
115. 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
116. On the iterative realization of nonanticipating multivalued mappings
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 3,  66–76
117. 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
118. Topological constructions of extensions and representations of attraction sets
A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 6:1 (2000),  247–276
119. Well-posed extensions of unstable control problems with integral constraints
A. G. Chentsov
Izv. RAN. Ser. Mat., 63:3 (1999),  185–223
120. 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
121. 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
122. 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
123. 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
124. 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
125. To the Routing of Connections
L. N. Korotaeva, M. P. Trukhin, A. G. Chentsov
Avtomat. i Telemekh., 1997, no. 12,  175–192
126. 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
127. The program iteration method in the class of finitely additive control measures
A. G. Chentsov
Differ. Uravn., 33:11 (1997),  1528–1536
128. 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
129. 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
130. 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
131. 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
132. On correct extension of some stochastically constrained problems
A. G. Chentsov
Avtomat. i Telemekh., 1995, no. 7,  68–79
133. The problem of constructing sets of asymptotic attainability and its regularization
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1995, no. 10,  61–75
134. 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
135. 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
136. 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
137. 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
138. 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
139. 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
140. Dynamic programming in the problem of covering optimization
K. G. Sabiryanova, A. G. Chentsov
Avtomat. i Telemekh., 1994, no. 3,  54–64
141. 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
142. 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
143. 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
144. An assignment problem
L. N. Korotaeva, È. M. Nazarov, A. G. Chentsov
Zh. Vychisl. Mat. Mat. Fiz., 33:4 (1993),  483–494
145. Stability of some nonlinear extremal problems with actions of an impulse nature
A. G. Chentsov
Avtomat. i Telemekh., 1992, no. 5,  30–41
146. 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
147. Relaxation of constraints in multi-objective problems
E. G. Belov, A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 7,  3–8
148. On the asymptotic equivalence of relaxations of extremal problems
A. G. Chentsov
Izv. Vyssh. Uchebn. Zaved. Mat., 1991, no. 6,  53–60
149. On decomposition of the process of successive choice of variants
L. T. Buslaeva, A. G. Chentsov
Matem. Mod., 3:4 (1991),  103–113
150. 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
151. 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
152. Some topological properties of generalized solutions of nonlinear control systems
V. E. Pak, A. G. Chentsov
Differ. Uravn., 25:11 (1989),  2004–2005
153. 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
154. 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
155. 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
156. 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
157. 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
158. On the question of universal integrability of bounded functions
A. G. Chentsov
Mat. Sb. (N.S.), 131(173):1(9) (1986),  73–93
159. 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
160. A linear differential game of approach with a nonconvex target set
V. Ya. Ruzakov, A. G. Chentsov
Differ. Uravn., 20:4 (1984),  593–597
161. On an alternative in a class of quasistrategies for a differential approach-evasion game
A. G. Chentsov
Differ. Uravn., 16:10 (1980),  1801–1808
162. A class of differential games in mixed strategies
V. Ya. Ruzakov, A. G. Chentsov
Differ. Uravn., 16:10 (1980),  1794–1800
163. 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
164. Maximin deviation in a differential game
A. G. Chentsov
Differ. Uravn., 12:5 (1976),  848–856
165. 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
166. A certain approximation of a differential game in mixed strategies
V. D. Batukhtin, A. G. Chentsov
Differ. Uravn., 11:10 (1975),  1732–1737
167. 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

168. 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
169. 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
170. 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
171. 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
172. 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
173. 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
174. 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
175. 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. 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   
2. 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   
3. Programmed iteration method for the problem of feedback absorption set design
A. G. Chentsov
Seminar of Control System Department
April 7, 2016 12:00
4. 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
5. 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
6. 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
7. Discrete optimization
A. G. Chentsov
Seminar of Control System Department
May 21, 2015 12:00
8. 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
9. An extension of abstract attainability problem under asymptotic constrains
A. G. Chentsov, A. P. Baklanov
Seminar of Control System Department
December 11, 2014
10. 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