Bondarenko Vladimir Aleksandrovich

Publications in Math-Net.Ru

1. On the skeleton of the polytope of pyramidal tours
   
   Diskretn. Anal. Issled. Oper., 25:1 (2018),  5–24
2. Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems
   
   Model. Anal. Inform. Sist., 24:2 (2017),  141–154
3. 1-Skeletons of the spanning tree problems with additional constraints
   
   Model. Anal. Inform. Sist., 22:4 (2015),  453–463
4. On a recognition problem on cut polytope relaxations
   
   Avtomat. i Telemekh., 2014, no. 9,  108–121
5. Some Properties of Metric Polytope Constraints
   
   Model. Anal. Inform. Sist., 21:4 (2014),  25–34
6. Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
   
   Model. Anal. Inform. Sist., 19:6 (2012),  101–106
7. On random 2-adjacent 0/1-polyhedra
   
   Diskr. Mat., 20:1 (2008),  64–69
8. On one problem of integer optimization
   
   Avtomat. i Telemekh., 2007, no. 6,  18–23
9. Lexicographic optimization in multicriterial discrete problems
   
   Avtomat. i Telemekh., 2000, no. 2,  29–35
10. Fractal image compression in the Barnsley–Sloan sense
    
    Avtomat. i Telemekh., 1994, no. 5,  12–20
11. On the density of polyhedral graphs of combinatorial optimization problems
    
    Avtomat. i Telemekh., 1993, no. 6,  60–66
12. Polyhedra with graphs of high density, and the polynomial solvability of combinatorial optimization problems
    
    Avtomat. i Telemekh., 1993, no. 4,  21–26
13. A problem on the difficulty of solving and the analysis of heuristics in discrete optimization. II
    
    Avtomat. i Telemekh., 1993, no. 1,  27–32
14. A class of polyhedra and their use in combinatorial optimization
    
    Dokl. Akad. Nauk, 328:3 (1993),  303–304
15. Estimates for the complexity of combinatorial optimization problems in a class of algorithms
    
    Dokl. Akad. Nauk, 328:1 (1993),  22–24
16. A problem on the difficulty of solving and the analysis of heuristics in discrete optimization. I
    
    Avtomat. i Telemekh., 1992, no. 12,  20–24
17. On Unimodality of Functions Characterizing the Reliability of Program Packages
    
    Avtomat. i Telemekh., 1985, no. 11,  167–169
18. Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms
    
    Avtomat. i Telemekh., 1983, no. 9,  45–50
19. Analysis of discrete optimization algorithms using incomplete information
    
    Zh. Vychisl. Mat. Mat. Fiz., 21:3 (1981),  783–786
20. The superposition operator in Hölder function spaces
    
    Dokl. Akad. Nauk SSSR, 222:6 (1975),  1265–1268
21. Integral inequalities for Volterra's equation in a Banach space with a cone
    
    Mat. Zametki, 9:2 (1971),  151–160
22. Integral inequalities with nonmonotonic functions
    
    Differ. Uravn., 5:3 (1969),  565–567


23. Memory of M. A. Krasnosel'skii
    
    Avtomat. i Telemekh., 1998, no. 2,  179–184