Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Bondarenko, Vladimir Aleksandrovich

Statistics Math-Net.Ru
Total publications: 22
Scientific articles: 21

Number of views:
This page:1436
Abstract pages:6304
Full texts:1786
References:283
Professor
Doctor of physico-mathematical sciences

http://www.mathnet.ru/eng/person38420
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/210526

Publications in Math-Net.Ru
2018
1. V. A. Bondarenko, A. V. Nikolaev, “On the skeleton of the polytope of pyramidal tours”, Diskretn. Anal. Issled. Oper., 25:1 (2018),  5–24  mathnet  elib; J. Appl. Industr. Math., 12:1 (2018), 9–18  scopus
2017
2. V. A. Bondarenko, A. V. Nikolaev, D. A. Shovgenov, “Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems”, Model. Anal. Inform. Sist., 24:2 (2017),  141–154  mathnet  elib
2015
3. V. A. Bondarenko, A. V. Nikolaev, D. A. Shovgenov, “1-Skeletons of the spanning tree problems with additional constraints”, Model. Anal. Inform. Sist., 22:4 (2015),  453–463  mathnet  mathscinet  elib
2014
4. V. A. Bondarenko, A. V. Nikolaev, M. E. Symanovich, R. O. Shemyakin, “On a recognition problem on cut polytope relaxations”, Avtomat. i Telemekh., 2014, 9,  108–121  mathnet; Autom. Remote Control, 75:9 (2014), 1626–1636  isi  scopus
5. V. A. Bondarenko, A. V. Nikolaev, “Some Properties of Metric Polytope Constraints”, Model. Anal. Inform. Sist., 21:4 (2014),  25–34  mathnet
2012
6. A. I. Antonov, V. A. Bondarenko, “Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems”, Model. Anal. Inform. Sist., 19:6 (2012),  101–106  mathnet
2008
7. V. A. Bondarenko, A. G. Brodskiy, “On random 2-adjacent 0/1-polyhedra”, Diskr. Mat., 20:1 (2008),  64–69  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 18:2 (2008), 181–186  scopus
2007
8. V. A. Bondarenko, B. V. Uryvaev, “On one problem of integer optimization”, Avtomat. i Telemekh., 2007, 6,  18–23  mathnet  mathscinet  zmath; Autom. Remote Control, 68:6 (2007), 948–953  scopus
2000
9. V. A. Bondarenko, P. E. Kloeden, M. V. Krasnov, “Lexicographic optimization in multicriterial discrete problems”, Avtomat. i Telemekh., 2000, 2,  29–35  mathnet  mathscinet  zmath; Autom. Remote Control, 61:2 (2000), 200–205
1994
10. V. A. Bondarenko, V. L. Dol'nikov, “Fractal image compression in the Barnsley–Sloan sense”, Avtomat. i Telemekh., 1994, 5,  12–20  mathnet  mathscinet; Autom. Remote Control, 55:5 (1994), 623–629
1993
11. V. A. Bondarenko, “On the density of polyhedral graphs of combinatorial optimization problems”, Avtomat. i Telemekh., 1993, 6,  60–66  mathnet  mathscinet  zmath; Autom. Remote Control, 54:6 (1993), 919–923
12. V. A. Bondarenko, “Polyhedra with graphs of high density, and the polynomial solvability of combinatorial optimization problems”, Avtomat. i Telemekh., 1993, 4,  21–26  mathnet  mathscinet  zmath; Autom. Remote Control, 54:4 (1993), 541–545
13. V. A. Bondarenko, “A problem on the difficulty of solving and the analysis of heuristics in discrete optimization. II”, Avtomat. i Telemekh., 1993, 1,  27–32  mathnet  mathscinet  zmath; Autom. Remote Control, 54:1 (1993), 21–26
14. V. A. Bondarenko, “A class of polyhedra and their use in combinatorial optimization”, Dokl. Akad. Nauk, 328:3 (1993),  303–304  mathnet  mathscinet  zmath
15. V. A. Bondarenko, “Estimates for the complexity of combinatorial optimization problems in a class of algorithms”, Dokl. Akad. Nauk, 328:1 (1993),  22–24  mathnet  mathscinet  zmath
1992
16. V. A. Bondarenko, “A problem on the difficulty of solving and the analysis of heuristics in discrete optimization. I”, Avtomat. i Telemekh., 1992, 12,  20–24  mathnet  mathscinet  zmath; Autom. Remote Control, 53:12 (1992), 1832–1836
1985
17. V. A. Bondarenko, “On Unimodality of Functions Characterizing the Reliability of Program Packages”, Avtomat. i Telemekh., 1985, 11,  167–169  mathnet
1983
18. V. A. Bondarenko, “Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms”, Avtomat. i Telemekh., 1983, 9,  45–50  mathnet  mathscinet  zmath; Autom. Remote Control, 44:9 (1983), 1137–1142
1981
19. V. A. Bondarenko, A. A. Korotkin, “Analysis of discrete optimization algorithms using incomplete information”, Zh. Vychisl. Mat. Mat. Fiz., 21:3 (1981),  783–786  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 21:3 (1981), 259–264
1975
20. V. A. Bondarenko, P. P. Zabreiko, “The superposition operator in Hölder function spaces”, Dokl. Akad. Nauk SSSR, 222:6 (1975),  1265–1268  mathnet  mathscinet  zmath
1971
21. V. A. Bondarenko, “Integral inequalities for Volterra's equation in a Banach space with a cone”, Mat. Zametki, 9:2 (1971),  151–160  mathnet  mathscinet  zmath; Math. Notes, 9:2 (1971), 89–94

1998
22. E. A. Asarin, I. A. Bakhtin, N. A. Bobylev, V. A. Bondarenko, V. Sh. Burd, E. A. Gorin, S. V. Emel'yanov, P. P. Zabreiko, L. A. Ivanov, V. S. Kozyakin, A. M. Krasnosel'skii, N. A. Kuznetsov, A. B. Kurzhanskii, A. Yu. Levin, È. M. Muhamadiev, A. I. Perov, Yu. V. Pokornyi, A. V. Pokrovskii, D. I. Rachinskii, V. V. Strygin, Ya. Z. Tsypkin, V. V. Chernorutski, “Memory of M. A. Krasnosel'skii”, Avtomat. i Telemekh., 1998, 2,  179–184  mathnet

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