RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Chentsov, Alexander Georgievich

Statistics Math-Net.Ru
Total publications: 216
Scientific articles: 208
Presentations: 12

Number of views:
This page:5095
Abstract pages:34886
Full texts:11106
References:4958
Corresponding member of RAS
Professor
Doctor of physico-mathematical sciences (1977)
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
2020
1. A. G. Chentsov, “Ultrafilters and maximal linked systems”, Trudy Inst. Mat. i Mekh. UrO RAN, 26:1 (2020),  274–292  mathnet  elib
2. A. G. Chentsov, D. M. Khachai, “Relaxation of pursuit-evasion differential game and program absorption operator”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 30:1 (2020),  64–91  mathnet
2019
3. 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
4. A. G. Chentsov, “On the supercompactness of ultrafilter space with the topology of Wallman type”, Izv. IMI UdGU, 54 (2019),  74–101  mathnet
5. A. G. Chentsov, “Ultrafilters and maximal linked systems: basic relations”, Izv. IMI UdGU, 53 (2019),  138–157  mathnet  elib
6. D. A. Serkov, A. G. Chentsov, “On the construction of a nonanticipating selection of a multivalued mapping”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:3 (2019),  232–246  mathnet  elib
7. A. G. Chentsov, “Supercompact spaces of ultrafilters and maximal linked systems”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:2 (2019),  240–257  mathnet  elib
8. A. G. Chentsov, “The Programmed Iteration Method in a Game Problem of Realizing Trajectories in a Function Set”, Tr. Mat. Inst. Steklova, 304 (2019),  309–325  mathnet  elib; Proc. Steklov Inst. Math., 304 (2019), 292–308  isi  scopus
9. Alexander G. Chentsov, “To a question on the supercompactness of ultrafilter spaces”, Ural Math. J., 5:1 (2019),  31–47  mathnet  mathscinet  elib  scopus
10. A. G. Chentsov, E. G. Pytkeev, “Constraints of asymptotic nature and attainability problems”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:4 (2019),  569–582  mathnet  isi
11. 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
12. 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
13. A. G. Chentsov, “Ultrafilters and maximal linked systems: basic properties and topological constructions”, Izv. IMI UdGU, 52 (2018),  86–102  mathnet  elib
14. A. G. Chentsov, D. M. Khachai, “Relaxation of a differential game of approach-evasion and iterative methods”, Trudy Inst. Mat. i Mekh. UrO RAN, 24:4 (2018),  246–269  mathnet  elib
15. A. G. Chentsov, “Bitopological spaces of ultrafilters and maximal linked systems”, Trudy Inst. Mat. i Mekh. UrO RAN, 24:1 (2018),  257–272  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 305, suppl. 1 (2019), S24–S39  isi  scopus
16. 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
17. A. G. Chentsov, “Maximal linked systems and ultrafilters of widely understood measurable spaces”, Tambov University Reports. Series: Natural and Technical Sciences, 23:124 (2018),  846–860  mathnet
18. D. A. Serkov, A. G. Chentsov, “On the existence of a non-anticipating selection of non-anticipating multivalued mapping”, Tambov University Reports. Series: Natural and Technical Sciences, 23:124 (2018),  717–725  mathnet
19. A. G. Chentsov, A. M. Grigor'ev, “Optimizing multi-inserts in routing problems with constraints”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:4 (2018),  513–530  mathnet  elib
20. 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
21. E. G. Pytkeev, A. G. Chentsov, “The Wallman compactifier and its application for investigation of the abstract attainability problem”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:2 (2018),  199–212  mathnet  elib
22. A. G. Chentsov, I. I. Savenkov, Yu. V. Shapar', “A problem of program maximin with constraints of asymptotic nature”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 28:1 (2018),  91–110  mathnet  elib
23. 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
24. 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
2017
25. 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, 4,  106–125  mathnet  elib; Autom. Remote Control, 78:4 (2017), 666–681  isi  scopus
26. 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
27. A. G. Chentsov, “Superextension as bitopological space”, Izv. IMI UdGU, 49 (2017),  55–79  mathnet  elib
28. A. G. Chentsov, “Iterations of stability and the evasion problem with a constraint on the number of switchings of the formed control”, Izv. IMI UdGU, 49 (2017),  17–54  mathnet  elib
29. A. G. Chentsov, “Stability iterations and an evasion problem with a constraint on the number of switchings”, Trudy Inst. Mat. i Mekh. UrO RAN, 23:2 (2017),  285–302  mathnet  elib
30. 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
31. Alexander G. Chentsov, “Some representations connected with ultrafilters and maximal linked systems”, Ural Math. J., 3:2 (2017),  100–121  mathnet  mathscinet  elib
32. 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
33. A. G. Chentsov, “Ultrafilters and maximal linked systems”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:3 (2017),  365–388  mathnet  elib
34. 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
2016
35. A. G. Chentsov, P. A. Chentsov, “Routing under constraints: problem of visit to megalopolises”, Avtomat. i Telemekh., 2016, 11,  96–117  mathnet  elib; Autom. Remote Control, 77:11 (2016), 1957–1974  isi  elib  scopus
36. D. A. Serkov, A. G. Chentsov, “Implementation of the programmed iterations method in packages of spaces”, Izv. IMI UdGU, 2016, 2(48),  42–67  mathnet  elib
37. A. G. Chentsov, A. P. Baklanov, I. I. Savenkov, “A problem of attainability with constraints of asymptotic nature”, Izv. IMI UdGU, 2016, 1(47),  54–118  mathnet  mathscinet  zmath  elib
38. 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
39. E. G. Pytkeev, A. G. Chentsov, “Open ultrafilters and separability with the use of the operation of closure”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  212–225  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 299, suppl. 1 (2017), 177–190  isi  scopus
40. A. G. Chentsov, “The program iteration method in a game problem of guidance”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:2 (2016),  304–321  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 297, suppl. 1 (2017), 43–61  isi  scopus
41. A. G. Chentsov, “Compactifiers in extension constructions for reachability problems with constraints of asymptotic nature”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:1 (2016),  294–309  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 296, suppl. 1 (2017), 102–118  isi  scopus
42. Alexander G. Chentsov, “The program iterations method in game problem of guidance and set-valued quasistrategies”, Ural Math. J., 2:1 (2016),  17–37  mathnet  zmath  elib
43. A. G. Chentsov, “The Bellmann insertions in route problems with constraints and complicated cost functions. II”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:4 (2016),  565–578  mathnet  mathscinet  elib
44. E. G. Pytkeev, A. G. Chentsov, “Some representations of free ultrafilters”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:3 (2016),  345–365  mathnet  mathscinet  elib
45. A. G. Chentsov, “The programmed iterations method in a game problem of guidance”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:2 (2016),  271–282  mathnet  mathscinet  elib
46. 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
47. D. A. Serkov, A. G. Chentsov, “The elements of the operator convexity in the construction of the programmed iteration method”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 9:3 (2016),  82–93  mathnet  isi  elib
48. 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
49. E. G. Pytkeev, A. G. Chentsov, “Some properties of open ultrafilters”, Izv. IMI UdGU, 2015, 2(46),  140–148  mathnet  elib
50. 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
51. 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
52. A. G. Chentsov, M. Yu. Khachai, M. Yu. Khachai, “An exact algorithm with linear complexity for a problem of visiting megalopolises”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  309–317  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 38–46  isi  scopus
53. A. G. Chentsov, “An abstract reachability problem: “purely asymptotic” version”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:2 (2015),  289–305  mathnet  mathscinet  elib
54. A. G. Chentsov, A. P. Baklanov, “On an asymptotic analysis problem related to the construction of an attainability domain”, Tr. Mat. Inst. Steklova, 291 (2015),  292–311  mathnet  elib; Proc. Steklov Inst. Math., 291 (2015), 279–298  isi  scopus
55. D. A. Serkov, A. G. Chentsov, “Programmed iteration method and operator convexity in an abstract retention problem”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 25:3 (2015),  348–366  mathnet  elib
56. A. G. Chentsov, “To question about realization of attraction elements in abstract attainability problems”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 25:2 (2015),  212–229  mathnet  elib
2014
57. A. G. Chentsov, Yu. V. Shapar', “On extension of the maximin problem”, Avtomat. i Telemekh., 2014, 7,  155–174  mathnet; Autom. Remote Control, 75:7 (2014), 1283–1300  isi  scopus
58. A. G. Chentsov, “Problem of successive megalopolis traversal with the precedence conditions”, Avtomat. i Telemekh., 2014, 4,  170–190  mathnet; Autom. Remote Control, 75:4 (2014), 728–744  isi  scopus
59. A. G. Chentsov, E. G. Pytkeev, “Some topological structures of extensions of abstract reachability problems”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:4 (2014),  312–329  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 292, suppl. 1 (2016), 36–54  isi  scopus
60. A. G. Chentsov, A. P. Baklanov, “On the question of construction of an attraction set under constraints of asymptotic nature”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:3 (2014),  309–323  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 291, suppl. 1 (2015), 40–55  isi  scopus
61. E. G. Pytkeev, A. G. Chentsov, “On the structure of ultrafilters and properties related to convergence in topological spaces”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  250–267  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 164–181  isi  scopus
62. A. G. Chentsov, “Ultrafilters of measurable spaces and their application in extension constructions”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:1 (2014),  285–304  mathnet  mathscinet  elib
63. A. G. Chentsov, “The Bellmann insertions in the route problem with constraints and complicated cost functions”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, 4,  122–141  mathnet
64. A. G. Chentsov, “To the validity of constraints in the class of generalized elements”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, 3,  90–109  mathnet
65. 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, 2,  56–75  mathnet
66. A. G. Chentsov, “Some ultrafilter properties connected with extension constructions”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, 1,  87–101  mathnet
2013
67. A. G. Chentsov, “On certain problems of the structure of ultrafilters related to extensions of abstract control problems”, Avtomat. i Telemekh., 2013, 12,  119–139  mathnet; Autom. Remote Control, 74:12 (2013), 2020–2036  isi  scopus
68. A. G. Chentsov, “Attraction sets in abstract attainability problems: equivalent representations and basic properties”, Izv. Vyssh. Uchebn. Zaved. Mat., 2013, 11,  33–50  mathnet; Russian Math. (Iz. VUZ), 57:11 (2013), 28–44  scopus
69. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in extremal route problems”, Probl. Upr., 2013, 5,  12–21  mathnet; Autom. Remote Control, 75:3 (2014), 537–550  isi
70. A. G. Chentsov, “On the question of representation of ultrafilters and their application in extension constructions”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:4 (2013),  289–307  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 287, suppl. 1 (2014), 29–48  isi  scopus
71. A. G. Chentsov, “On the question of representation of ultrafilters in a product of measurable spaces”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  307–319  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 284, suppl. 1 (2014), 65–78  isi  scopus
72. A. G. Chentsov, “To question about representation of Stone compactums”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, 4,  156–174  mathnet
73. 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, 3,  88–113  mathnet
74. A. G. Chentsov, “To question of routing of works complexes”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, 1,  59–82  mathnet
75. 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
76. A. G. Chentsov, “On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs”, Avtomat. i Telemekh., 2012, 3,  134–149  mathnet; Autom. Remote Control, 73:3 (2012), 532–546  isi  scopus
77. A. G. Chentsov, P. A. Chentsov, “Dynamic programming in a nonstationary route problem”, Izv. IMI UdGU, 2012, 1(39),  151–154  mathnet
78. A. G. Chentsov, “To the question about structure of attraction set in a topological space”, Izv. IMI UdGU, 2012, 1(39),  147–150  mathnet
79. A. G. Chentsov, “Representation of attraction elements in abstract attainability problems with asymptotic constraints”, Izv. Vyssh. Uchebn. Zaved. Mat., 2012, 10,  45–59  mathnet  mathscinet; Russian Math. (Iz. VUZ), 56:10 (2012), 38–49  scopus
80. A. G. Chentsov, P. A. Chentsov, “On a Nonstationary Route Problem with Constraints”, Model. Anal. Inform. Sist., 19:4 (2012),  5–24  mathnet
81. A. G. Chentsov, “Tier mappings and ultrafilter-based transformations”, Trudy Inst. Mat. i Mekh. UrO RAN, 18:4 (2012),  298–314  mathnet  elib
82. 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
83. 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
84. A. G. Chentsov, “About an example of the attraction set construction with employment of Stone space”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, 4,  108–124  mathnet
85. A. G. Chentsov, “The transformation of ultrafilters and their application in constructions of attraction sets”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, 3,  85–102  mathnet
86. I. B. Cheblokov, A. G. Chentsov, “About one route problem with interior works”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, 1,  96–119  mathnet
87. A. G. Chentsov, “A Parallel Procedure of Constructing Bellman Function in the Generalized Courier Problem with Interior Works”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 2012, 12,  53–76  mathnet
2011
88. A. G. Chentsov, “On approximate constraint satisfaction”, Izv. Vyssh. Uchebn. Zaved. Mat., 2011, 2,  86–102  mathnet  mathscinet; Russian Math. (Iz. VUZ), 55:2 (2011), 75–89  scopus
89. A. M. Grigoriev, E. E. Ivanko, A. G. Chentsov, “Dynamic programming in a generalized courier problem with inner tasks: elements of a parallel structure”, Model. Anal. Inform. Sist., 18:3 (2011),  101–124  mathnet
90. A. G. Chentsov, “On one example of representing the ultrafilter space for an algebra of sets”, Trudy Inst. Mat. i Mekh. UrO RAN, 17:4 (2011),  293–311  mathnet  elib
91. A. G. Chentsov, “One representation of the results of action of approximate solutions in a problem with constraints of asymptotic nature”, Trudy Inst. Mat. i Mekh. UrO RAN, 17:2 (2011),  225–239  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 276, suppl. 1 (2012), S48–S62  isi  scopus
92. A. G. Chentsov, “Ultrafilters of measurable spaces as generalized solutions in abstract attainability problems”, Trudy Inst. Mat. i Mekh. UrO RAN, 17:1 (2011),  268–293  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 275, suppl. 1 (2011), S12–S39  isi  scopus
93. A. G. Chentsov, “About correctness of some problems of control by material point”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2011, 3,  127–141  mathnet
94. A. G. Chentsov, “Filters and ultrafilters in the constructions of attraction sets”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2011, 1,  113–142  mathnet
2010
95. A. G. Chentsov, Yu. V. Shapar', “On a generalization of one game control problem in the class of finitely additive measures”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, 7,  86–102  mathnet  mathscinet; Russian Math. (Iz. VUZ), 54:7 (2010), 75–90  scopus
96. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “An extremal constrained routing problem with internal losses”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, 6,  64–81  mathnet  mathscinet; Russian Math. (Iz. VUZ), 54:6 (2010), 54–68  scopus
97. A. G. Chentsov, “To the question about stability of attainability domain in abstract problem with constraints of the moment character”, Trudy Inst. Mat. i Mekh. UrO RAN, 16:5 (2010),  205–212  mathnet  elib
98. 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
99. 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
100. A. G. Chentsov, “On obeying constraints of asymptotic character”, Tr. Mat. Inst. Steklova, 271 (2010),  59–75  mathnet  mathscinet  elib; Proc. Steklov Inst. Math., 271 (2010), 53–68  isi  scopus
101. A. G. Chentsov, “About presentation of maximin in the game problem with constraints of asymptotic character”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, 3,  104–119  mathnet
102. A. G. Chentsov, “To the question about precise and approximate validity in abstract control problem”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, 2,  29–48  mathnet
103. A. G. Chentsov, Yu. V. Shapar', “Finitely additive measures and extensions of the game problems with constraints of asymptotic character”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, 1,  89–111  mathnet
2009
104. 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
105. A. G. Chentsov, “On the result equivalence of constraints of asymptotic nature”, Trudy Inst. Mat. i Mekh. UrO RAN, 15:3 (2009),  241–261  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 268, suppl. 1 (2010), S32–S53  isi  scopus
106. A. G. Chentsov, “Some properties of the operator of the measure extension”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2009, 3,  114–127  mathnet
107. A. G. Chentsov, “Extensions in the class of finitely additive measures and conditions of asymptotic non-sensitivity under a weakening of the part of constraints”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2009, 1,  131–152  mathnet
2008
108. A. G. Chentsov, “Quasistrategies in an abstract guidance control problem”, Izv. Vyssh. Uchebn. Zaved. Mat., 2008, 10,  55–69  mathnet  mathscinet  zmath  elib; Russian Math. (Iz. VUZ), 52:10 (2008), 46–59
109. A. G. Chentsov, “Extension of the abstract attainability problem using the Stone representation space”, Izv. Vyssh. Uchebn. Zaved. Mat., 2008, 3,  63–75  mathnet  mathscinet  zmath  elib; Russian Math. (Iz. VUZ), 52:3 (2008), 58–68
110. 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
111. 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
112. A. G. Chentsov, “The space of Stone representation and constructions of extensions”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2008, 2,  169–172  mathnet
2007
113. A. G. Chentsov, “Construction of limiting process operations using ultrafilters of measurable spaces”, Avtomat. i Telemekh., 2007, 11,  208–222  mathnet  mathscinet  zmath  elib; Autom. Remote Control, 68:11 (2007), 2083–2096  elib  scopus
114. A. G. Chentsov, “Generalized elements in problem on asymptotic attainability”, Izv. Vyssh. Uchebn. Zaved. Mat., 2007, 11,  56–70  mathnet  mathscinet; Russian Math. (Iz. VUZ), 51:11 (2007), 55–68
115. A. A. Chentsov, A. G. Chentsov, “О реализации метода динамического программирования в обобщенной задаче курьера”, Trudy Inst. Mat. i Mekh. UrO RAN, 13:3 (2007),  136–160  mathnet  elib
116. A. G. Chentsov, “Extensions of abstract problems of attainability: Nonsequential version”, Trudy Inst. Mat. i Mekh. UrO RAN, 13:2 (2007),  184–217  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 259, suppl. 2 (2007), S46–S82  scopus
2006
117. A. G. Chentsov, “Certain problems of asymptotic analysis and extensions. II”, Avtomat. i Telemekh., 2006, 1,  128–145  mathnet  mathscinet  zmath  elib; Autom. Remote Control, 67:1 (2006), 115–131  elib  scopus
118. A. G. Chentsov, “Extreme problems of routing with restrictions”, Izv. IMI UdGU, 2006, 3(37),  163–166  mathnet
119. A. G. Chentsov, “On the compactification of a pencil of trajectories of an abstract control system”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, 5,  55–66  mathnet  mathscinet  zmath  elib; Russian Math. (Iz. VUZ), 50:5 (2006), 50–61
120. A. G. Chentsov, “Nonsequential approximate solutions in abstract problems of attainability”, Trudy Inst. Mat. i Mekh. UrO RAN, 12:1 (2006),  216–241  mathnet  mathscinet  zmath  elib; Proc. Steklov Inst. Math. (Suppl.), 253, suppl. 1 (2006), S48–S75  scopus
121. A. G. Chentsov, “On the structure of an extremal problem of rout optimization with constraints in the form of precedence conditions”, Vestn. Udmurtsk. Univ. Mat., 2006, 1,  127–150  mathnet
2005
122. A. G. Chentsov, “Certain problems of asymptotic analysis and extensions. I”, Avtomat. i Telemekh., 2005, 12,  125–142  mathnet  mathscinet  zmath  elib; Autom. Remote Control, 66:12 (2005), 1983–1999  elib  scopus
123. D. V. Khlopin, A. G. Chentsov, “On a Control Problem with Incomplete Information: Quasistrategies and Control Procedures with a Model”, Differ. Uravn., 41:12 (2005),  1652–1666  mathnet  mathscinet; Differ. Equ., 41:12 (2005), 1727–1742
124. T. Yu. Kashirtseva, A. G. Chentsov, “On a representation of a pencil of admissible trajectories in a linear control problem with an impulse constraint”, Izv. Vyssh. Uchebn. Zaved. Mat., 2005, 12,  15–27  mathnet  mathscinet; Russian Math. (Iz. VUZ), 49:12 (2005), 13–24
125. A. G. Chentsov, “Quasistrategies in an abstract control problem and the method of programmed iterations (a direct version)”, Izv. Vyssh. Uchebn. Zaved. Mat., 2005, 11,  53–65  mathnet  mathscinet  elib; Russian Math. (Iz. VUZ), 49:11 (2005), 50–61
126. A. G. Chentsov, “Approximate solutions in the problem of asymptotic attainability”, Izv. Vyssh. Uchebn. Zaved. Mat., 2005, 8,  63–73  mathnet  mathscinet; Russian Math. (Iz. VUZ), 49:8 (2005), 59–69
2004
127. A. G. Chentsov, “An abstract confinement problem: a programmed iterations method of solution”, Avtomat. i Telemekh., 2004, 2,  157–169  mathnet  mathscinet  zmath  elib; Autom. Remote Control, 65:2 (2004), 299–310  isi  elib  scopus
128. A. V. Skvortsova, A. G. Chentsov, “On the construction of an asymptotic analog of a pencil of trajectories for a linear system with a single-impulse control”, Differ. Uravn., 40:12 (2004),  1645–1657  mathnet  mathscinet; Differ. Equ., 40:12 (2004), 1726–1739
129. A. G. Chentsov, “Generalized attraction sets and approximate solutions forming them”, Trudy Inst. Mat. i Mekh. UrO RAN, 10:2 (2004),  178–196  mathnet  mathscinet  zmath  elib; Proc. Steklov Inst. Math. (Suppl.), 2004no. , suppl. 2, S20–S39
2003
130. A. G. Chentsov, “A Version of the Program Iteration Method”, Differ. Uravn., 39:8 (2003),  1076–1086  mathnet  mathscinet; Differ. Equ., 39:8 (2003), 1132–1143
131. A. G. Chentsov, “Недираковские $(0,1)$-меры и $\sigma$-топологические пространства”, Vestnik Chelyabinsk. Gos. Univ., 2003, 8,  190–202  mathnet
2002
132. 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, 11,  151–166  mathnet  mathscinet  zmath; Autom. Remote Control, 63:11 (2002), 1832–1845  isi  scopus
133. A. G. Chentsov, P. A. Chentsov, “Dynamic Programming in the Problem of Decomposition Optimization”, Avtomat. i Telemekh., 2002, 5,  133–146  mathnet  mathscinet  zmath; Autom. Remote Control, 63:5 (2002), 815–828  isi  scopus
134. A. G. Chentsov, “Some questions of the structure of the programmed iterations method”, Fundam. Prikl. Mat., 8:3 (2002),  921–942  mathnet  mathscinet  zmath
135. A. G. Chentsov, “On the construction of correct extensions in the class of finitely additive measures”, Izv. Vyssh. Uchebn. Zaved. Mat., 2002, 2,  58–80  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 46:2 (2002), 55–77
2001
136. A. G. Chentsov, “Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: II”, Differ. Uravn., 37:5 (2001),  679–688  mathnet  mathscinet; Differ. Equ., 37:5 (2001), 713–723
137. A. G. Chentsov, “Nonanticipating Multimappings and Their Construction by the Method of Program Iterations: I”, Differ. Uravn., 37:4 (2001),  470–480  mathnet  mathscinet; Differ. Equ., 37:4 (2001), 498–509
138. A. G. Chentsov, “On the duality of various versions of the programmed iteration method”, Izv. Vyssh. Uchebn. Zaved. Mat., 2001, 12,  77–88  mathnet  mathscinet  zmath  elib; Russian Math. (Iz. VUZ), 45:12 (2001), 74–85
2000
139. A. A. Chentsov, A. G. Chentsov, “Reduction of route optimization problems”, Avtomat. i Telemekh., 2000, 10,  136–150  mathnet  mathscinet  zmath; Autom. Remote Control, 61:10 (2000), 1708–1722
140. 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, 4,  129–142  mathnet  mathscinet  zmath; Autom. Remote Control, 61:4 (2000), 658–670
141. A. G. Chentsov, “On the iterative realization of nonanticipating multivalued mappings”, Izv. Vyssh. Uchebn. Zaved. Mat., 2000, 3,  66–76  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 44:3 (2000), 63–73
142. A. G. Chentsov, “Universal version of generalized integral constraints in the class of finitely additive measures. II”, Izv. Vyssh. Uchebn. Zaved. Mat., 2000, 2,  69–77  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 44:2 (2000), 67–74
143. A. G. Chentsov, “Topological constructions of extensions and representations of attraction sets”, Trudy Inst. Mat. i Mekh. UrO RAN, 6:1 (2000),  247–276  mathnet  mathscinet  zmath  elib; Proc. Steklov Inst. Math. (Suppl.), 2000no. , suppl. 1, S35–S60
1999
144. A. G. Chentsov, “Well-posed extensions of unstable control problems with integral constraints”, Izv. RAN. Ser. Mat., 63:3 (1999),  185–223  mathnet  mathscinet  zmath; Izv. Math., 63:3 (1999), 599–630  isi  scopus
145. A. G. Chentsov, “Universal version of generalized integral constraints in the class of finitely additive measures. I”, Izv. Vyssh. Uchebn. Zaved. Mat., 1999, 7,  67–74  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 43:7 (1999), 63–71
146. A. I. Subbotin, A. G. Chentsov, “An Iterative Procedure for Constructing Minimax and Viscosity Solutions to the Hamilton–Jacobi Equations and Its Generalization”, Tr. Mat. Inst. Steklova, 224 (1999),  311–334  mathnet  mathscinet  zmath; Proc. Steklov Inst. Math., 224 (1999), 286–309
147. A. G. Chentsov, T. Yu. Kashirtseva, “Обобщенные траектории линейных управляемых систем с разрывными коэффициентами при управлении”, Vestnik Chelyabinsk. Gos. Univ., 1999, 5,  137–146  mathnet
1998
148. A. A. Chentsov, A. G. Chentsov, “On the solution of the route optimization problem by the dynamic programming method”, Avtomat. i Telemekh., 1998, 9,  117–129  mathnet  mathscinet  zmath; Autom. Remote Control, 59:9 (1998), 1299–1307
149. A. G. Chentsov, “The universal asymptotic realization of integral constraints and constructions of extension in the class of finitely additive measures”, Trudy Inst. Mat. i Mekh. UrO RAN, 5 (1998),  328–356  mathnet  zmath
150. N. M. Loginova, A. G. Chentsov, “On extension of stochastic constraints in the class of finitely additive probabilities”, Trudy Inst. Mat. i Mekh. UrO RAN, 5 (1998),  277–300  mathnet  zmath
1997
151. L. N. Korotaeva, M. P. Trukhin, A. G. Chentsov, “To the Routing of Connections”, Avtomat. i Telemekh., 1997, 12,  175–192  mathnet  mathscinet
152. S. I. Morina, A. G. Chentsov, “An Extension of Control Problem in the Class of Vector Finitely Additive Measures”, Avtomat. i Telemekh., 1997, 7,  207–216  mathnet  mathscinet  zmath; Autom. Remote Control, 58:7 (1997), 1235–1242
153. A. G. Chentsov, “The program iteration method in the class of finitely additive control measures”, Differ. Uravn., 33:11 (1997),  1528–1536  mathnet  mathscinet; Differ. Equ., 33:11 (1997), 1533–1541
154. A. G. Chentsov, “On extension of stochastic constraints in the class of finite-additive probabilities”, Izv. Vyssh. Uchebn. Zaved. Mat., 1997, 6,  57–69  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 41:6 (1997), 54–65
155. B. B. Zobnin, L. N. Korotaeva, A. G. Chentsov, “On a Problem of Route Optimization and Its Applications”, Probl. Peredachi Inf., 33:4 (1997),  70–87  mathnet  mathscinet  zmath; Problems Inform. Transmission, 33:4 (1997), 346–361
156. V. I. Kuznetsov, A. G. Chentsov, “On a construction of an extension of an abstract, purely pulse control problem”, Zh. Vychisl. Mat. Mat. Fiz., 37:5 (1997),  524–532  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 37:5 (1997), 510–518
1996
157. A. I. Subbotin, A. G. Chentsov, “An iterative procedure for constructing minimax and viscosity solutions of the Hamilton–Jacobi equations”, Dokl. Akad. Nauk, 348:6 (1996),  736–739  mathnet  mathscinet  zmath
158. A. G. Chentsov, “Finitely additive vector measures and the regularization questions in the problem about constructing of the sets of asymptotic attainability”, Trudy Inst. Mat. i Mekh. UrO RAN, 4 (1996),  266–295  mathnet  mathscinet  zmath  elib
159. A. G. Chentsov, “К вопросу об условиях асимптотической нечувствительности достижимого множества при возмущении части ограничений”, Vestnik Chelyabinsk. Gos. Univ., 1996, 3,  189–205  mathnet
160. L. A. Savinova, A. G. Chentsov, “К вопросу о расширении некоторых вольтерровых операторов в классе конечно-аддитивных мер”, Vestnik Chelyabinsk. Gos. Univ., 1996, 3,  117–134  mathnet
161. E. G. Belov, A. G. Chentsov, “К вопросу о конструкции расширения в одном классе экстремальных задач”, Vestnik Chelyabinsk. Gos. Univ., 1996, 3,  15–20  mathnet
1995
162. A. G. Chentsov, “On correct extension of some stochastically constrained problems”, Avtomat. i Telemekh., 1995, 7,  68–79  mathnet  mathscinet  zmath; Autom. Remote Control, 56:7 (1995), 964–972
163. A. G. Chentsov, “The problem of constructing sets of asymptotic attainability and its regularization”, Izv. Vyssh. Uchebn. Zaved. Mat., 1995, 10,  61–75  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 39:10 (1995), 58–72
164. A. G. Chentsov, “Asymptotic attainability with perturbation of integral constraints in an abstract control problem. II”, Izv. Vyssh. Uchebn. Zaved. Mat., 1995, 3,  62–73  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 39:3 (1995), 60–71
165. A. G. Chentsov, “Asymptotic attainability with perturbation of integral constraints in an abstract control problem. I”, Izv. Vyssh. Uchebn. Zaved. Mat., 1995, 2,  60–71  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 39:2 (1995), 57–68
166. A. G. Chentsov, “On the correct extension of a problem of selecting the probability density under constraints on a system of mathematical expectations”, Uspekhi Mat. Nauk, 50:5(305) (1995),  223–242  mathnet  mathscinet  zmath; Russian Math. Surveys, 50:5 (1995), 1065–1084  isi
167. A. G. Chentsov, “The asymptotically attainable elements and their generalized representation in class of finitely additive measures”, Trudy Inst. Mat. i Mekh. UrO RAN, 3 (1995),  211–244  mathnet  mathscinet  zmath  elib
168. A. G. Chentsov, “Asymptotically attainable elements: Generalized constructions and the realization in the class of approximate solutions”, Trudy Mat. Inst. Steklov., 211 (1995),  443–456  mathnet  mathscinet  zmath; Proc. Steklov Inst. Math., 211 (1995), 401–413
169. L. N. Korotaeva, A. G. Chentsov, “On a generalization of the bottleneck traveling salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 35:7 (1995),  1067–1076  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 35:7 (1995), 853–859  isi
1994
170. K. G. Sabiryanova, A. G. Chentsov, “Dynamic programming in the problem of covering optimization”, Avtomat. i Telemekh., 1994, 3,  54–64  mathnet  mathscinet  zmath; Autom. Remote Control, 55:3 (1994), 347–355
171. A. G. Chentsov, “Asymptotic attainability and its generalized representation”, Dokl. Akad. Nauk, 334:4 (1994),  437–440  mathnet  mathscinet  zmath; Dokl. Math., 49:1 (1994), 138–143
172. V. E. Pak, A. G. Chentsov, “On the regularization of the function of the asymptotic value of a control problem under perturbation of the set of initial positions”, Differ. Uravn., 30:11 (1994),  1939–1948  mathnet  mathscinet; Differ. Equ., 30:11 (1994), 1790–1799
173. A. G. Chentsov, “Асимптотика достижимых множеств и обобщенные конструкции в классе конечно-аддитивных мер”, Vestnik Chelyabinsk. Gos. Univ., 1994, 2,  126–134  mathnet
174. S. I. Morina, A. G. Chentsov, “Об одной задаче асимптотической оптимизации”, Vestnik Chelyabinsk. Gos. Univ., 1994, 2,  80–86  mathnet
1993
175. V. P. Serov, A. G. Chentsov, “On a programmed linear game-theoretic guidance problem with constraints on the control force impulse”, Avtomat. i Telemekh., 1993, 5,  61–74  mathnet  mathscinet  zmath; Autom. Remote Control, 54:5 (1993), 755–768
176. A. G. Chentsov, “Asymptotically admissible elements: insensitivity to disturbance of some of the conditions and physical realizability”, Izv. Vyssh. Uchebn. Zaved. Mat., 1993, 5,  112–123  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 37:5 (1993), 100–110
177. L. N. Korotaeva, È. M. Nazarov, A. G. Chentsov, “An assignment problem”, Zh. Vychisl. Mat. Mat. Fiz., 33:4 (1993),  483–494  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 33:4 (1993), 443–452  isi
1992
178. A. G. Chentsov, “Stability of some nonlinear extremal problems with actions of an impulse nature”, Avtomat. i Telemekh., 1992, 5,  30–41  mathnet  mathscinet  zmath; Autom. Remote Control, 53:5 (1992), 646–655
179. V. E. Pak, A. G. Chentsov, “On a regularization procedure for a function of the value of a nonlinear control problem”, Differ. Uravn., 28:3 (1992),  414–422  mathnet  mathscinet; Differ. Equ., 28:3 (1992), 347–355
1991
180. E. G. Belov, A. G. Chentsov, “Relaxation of constraints in multi-objective problems”, Izv. Vyssh. Uchebn. Zaved. Mat., 1991, 7,  3–8  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 35:7 (1991), 1–5
181. A. G. Chentsov, “On the asymptotic equivalence of relaxations of extremal problems”, Izv. Vyssh. Uchebn. Zaved. Mat., 1991, 6,  53–60  mathnet  mathscinet  zmath; Soviet Math. (Iz. VUZ), 35:6 (1991), 53–59
182. L. T. Buslaeva, A. G. Chentsov, “On decomposition of the process of successive choice of variants”, Matem. Mod., 3:4 (1991),  103–113  mathnet  mathscinet  zmath
183. A. G. Chentsov, “Релаксация некоторых экстремальных задач с интегральными ограничениями”, Vestnik Chelyabinsk. Gos. Univ., 1991, 1,  37–46  mathnet
1990
184. V. P. Serov, A. G. Chentsov, “On a construction of an extension of a control problem with integral constraints”, Differ. Uravn., 26:4 (1990),  607–618  mathnet  mathscinet  zmath; Differ. Equ., 26:4 (1990), 442–450
1989
185. S. I. Morina, A. G. Chentsov, “Discrete-time control in mathematical programming problems dual to successive adaptation problems”, Avtomat. i Telemekh., 1989, 2,  47–56  mathnet  mathscinet  zmath; Autom. Remote Control, 50:2 (1989), 167–174
186. V. E. Pak, A. G. Chentsov, “Some topological properties of generalized solutions of nonlinear control systems”, Differ. Uravn., 25:11 (1989),  2004–2005  mathnet  zmath
187. L. N. Korotaeva, A. N. Sesekin, A. G. Chentsov, “A modification of the dynamic programming method for the travelling-salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 29:8 (1989),  1107–1113  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 29:4 (1989), 96–100
188. È. M. Nazarov, A. G. Chentsov, “Duality and dynamic programming in the control of simple motion”, Zh. Vychisl. Mat. Mat. Fiz., 29:4 (1989),  614–616  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 29:2 (1989), 201–203
1987
189. E. G. Belov, A. G. Chentsov, “Certain properties of two-valued measures and the conditions of universal integrability”, Mat. Zametki, 42:2 (1987),  288–297  mathnet  mathscinet  zmath; Math. Notes, 42:2 (1987), 661–665  isi
190. V. M. Ivanov, A. G. Chentsov, “On the control of discrete systems in an infinite time interval”, Zh. Vychisl. Mat. Mat. Fiz., 27:12 (1987),  1780–1789  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 27:6 (1987), 116–121
1986
191. A. N. Sesekin, A. G. Chentsov, “Optimal performance of specified motions of a linear discrete system with bounded resources”, Avtomat. i Telemekh., 1986, 6,  56–61  mathnet  mathscinet  zmath; Autom. Remote Control, 47:6 (1986), 780–785
192. A. G. Chentsov, “On the question of universal integrability of bounded functions”, Mat. Sb. (N.S.), 131(173):1(9) (1986),  73–93  mathnet  mathscinet  zmath; Math. USSR-Sb., 59:1 (1988), 75–94
1984
193. V. P. Dyatlov, A. G. Chentsov, “A class of linear differential games with a constraint on the number of switchings”, Differ. Uravn., 20:8 (1984),  1442  mathnet  mathscinet
194. V. Ya. Ruzakov, A. G. Chentsov, “A linear differential game of approach with a nonconvex target set”, Differ. Uravn., 20:4 (1984),  593–597  mathnet  mathscinet
1980
195. A. G. Chentsov, “On an alternative in a class of quasistrategies for a differential approach-evasion game”, Differ. Uravn., 16:10 (1980),  1801–1808  mathnet  mathscinet  zmath
196. V. Ya. Ruzakov, A. G. Chentsov, “A class of differential games in mixed strategies”, Differ. Uravn., 16:10 (1980),  1794–1800  mathnet  mathscinet  zmath
1978
197. A. G. Chentsov, “An iterative program construction for a differential game with fixed termination time”, Dokl. Akad. Nauk SSSR, 240:1 (1978),  36–39  mathnet  mathscinet  zmath
198. A. G. Chentsov, “On the game problem of convergence at a given moment of time”, Izv. Akad. Nauk SSSR Ser. Mat., 42:2 (1978),  455–467  mathnet  mathscinet  zmath; Math. USSR-Izv., 12:2 (1978), 426–437
1977
199. A. G. Chentsov, “The value of a differential game with generalized payoff”, Dokl. Akad. Nauk SSSR, 237:1 (1977),  41–43  mathnet  mathscinet  zmath
1976
200. A. G. Chentsov, “On a game problem on the minimax functional”, Dokl. Akad. Nauk SSSR, 230:5 (1976),  1047–1050  mathnet  mathscinet  zmath
201. A. G. Chentsov, “On a game problem of guidance with information memory”, Dokl. Akad. Nauk SSSR, 227:2 (1976),  306–308  mathnet  mathscinet  zmath
202. A. G. Chentsov, “On a game problem of guidance”, Dokl. Akad. Nauk SSSR, 226:1 (1976),  73–76  mathnet  mathscinet  zmath
203. A. G. Chentsov, “Maximin deviation in a differential game”, Differ. Uravn., 12:5 (1976),  848–856  mathnet  mathscinet  zmath
204. A. G. Chentsov, “On a game problem of converging at a given instant of time”, Mat. Sb. (N.S.), 99(141):3 (1976),  394–420  mathnet  mathscinet  zmath; Math. USSR-Sb., 28:3 (1976), 353–376  isi
1975
205. A. G. Chentsov, “The structure of a certain game-theoretic approach problem”, Dokl. Akad. Nauk SSSR, 224:6 (1975),  1272–1275  mathnet  mathscinet
206. A. G. Chentsov, “A condition for a maximin in a game problem of programmed control”, Dokl. Akad. Nauk SSSR, 221:1 (1975),  48–51  mathnet  mathscinet  zmath
207. V. D. Batukhtin, A. G. Chentsov, “A certain approximation of a differential game in mixed strategies”, Differ. Uravn., 11:10 (1975),  1732–1737  mathnet  mathscinet
208. V. D. Batukhtin, A. G. Chentsov, “On a programmed construction in a positional differential game”, Izv. Akad. Nauk SSSR Ser. Mat., 39:4 (1975),  926–936  mathnet  mathscinet  zmath; Math. USSR-Izv., 9:4 (1975), 877–886
1974
209. A. G. Chentsov, “On stability conditions for a differential game”, Dokl. Akad. Nauk SSSR, 215:4 (1974),  800–803  mathnet  mathscinet  zmath
1973
210. A. G. Chentsov, “On a game problem of programmed control”, Dokl. Akad. Nauk SSSR, 213:2 (1973),  289–292  mathnet  mathscinet  zmath

2016
211. Sergei M. Aseev, Alexander G. Chentsov, Alexey A. Davydov, Nikolai L. Grigorenko, Vyacheslav I. Maksimov, Elena A. Rovenskaya, Alexander M. Tarasiev, “In memory of Arkady Viktorovich Kryazhimskiy (1949-2014)”, Ural Math. J., 2:2 (2016),  3–15  mathnet  zmath  elib
2015
212. A. G. Chentsov, Ya. V. Salii, “A model of “nonadditive” routing problem where the costs depend on the set of pending tasks”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 8:1 (2015),  24–45  mathnet  isi  elib
2014
213. 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, “Ivan Ivanovich Eremin”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  5–12  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 1–8  isi
214. 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, “In memory of Evgenii Leonidovich Tonkov (27.06.1940–28.09.2014)”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2014, 4,  146–154  mathnet
2012
215. N. N. Petrov, E. L. Tonkov, V. N. Ushakov, A. G. Chentsov, “In memory of Nikolai Nikolaevich Krasovskii (07.09.1924 – 04.04.2012)”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, 3,  157–158  mathnet
2011
216. 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, “To the 75th anniversary of academician of Russian Academy of Sciences Yu. S. Osipov”, Trudy Inst. Mat. i Mekh. UrO RAN, 17:2 (2011),  5–6  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 276, suppl. 1 (2012), S1–S3  scopus
2009
217. V. I. Berdyshev, M. I. Gusev, N. N. Krasovskii, Yu. S. Osipov, V. N. Ushakov, A. G. Chentsov, “Aleksandr Borisovich Kurzhanskii (on the occasion of his 70th birthday)”, Trudy Inst. Mat. i Mekh. UrO RAN, 15:4 (2009),  5–9  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 269, suppl. 1 (2010), S1–S5
2000
218. V. N. Ushakov, A. G. Chentsov, “Andrei Izmailovich Subbotin (Memorial issue)”, Trudy Inst. Mat. i Mekh. UrO RAN, 6:1 (2000),  3–26  mathnet  mathscinet  zmath  elib; Proc. Steklov Inst. Math. (Suppl.), 2000no. , suppl. 1, S1–S23

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, 2020