Orlov Andrei Vasil'evich

Publications in Math-Net.Ru

1. Triangles of conflicts and hexamatrix games
   
   Mat. Teor. Igr Pril., 16:4 (2024),  69–94
2. Hybrid global search algorithm with genetic blocks for solving hexamatrix games
   
   Bulletin of Irkutsk State University. Series Mathematics, 41 (2022),  40–56
3. On the problem polyhedral separability: a numerical solution
   
   Avtomat. i Telemekh., 2015, no. 10,  113–130
4. Numerical search for global solutions in problems of non-symmetric bilinear separability
   
   Diskretn. Anal. Issled. Oper., 22:1 (2015),  64–85
5. Oligopolistic banking sector of Mongolia and polymatrix games of three players
   
   Bulletin of Irkutsk State University. Series Mathematics, 11 (2015),  80–95
6. The test problem generation for quadratic-linear pessimistic bilevel optimization
   
   Sib. Zh. Vychisl. Mat., 17:3 (2014),  245–257
7. Global search for optimistic solutions in bilevel problem of optimal tariff choice by telecommunication company
   
   Bulletin of Irkutsk State University. Series Mathematics, 6:1 (2013),  57–71
8. Nonsmooth minimization problems for the difference of two convex functions
   
   Num. Meth. Prog., 12:4 (2011),  384–396
9. Numerical solution of a class of bilevel programming problems
   
   Sib. Zh. Vychisl. Mat., 13:2 (2010),  201–212
10. A local search for the quadratic-linear bilevel programming problem
    
    Sib. Zh. Vychisl. Mat., 13:1 (2010),  75–88
11. Numerical solution of bilinear programming problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 48:2 (2008),  237–254
12. A parallel search of equilibrium points in bimatrix games
    
    Num. Meth. Prog., 8:3 (2007),  233–243
13. A new approach to nonconvex optimization
    
    Num. Meth. Prog., 8:2 (2007),  160–176
14. Numerical search for equilibria in bimatrix games
    
    Zh. Vychisl. Mat. Mat. Fiz., 45:6 (2005),  983–997
15. Seeking the equilibrium situations in bimatrix games
    
    Avtomat. i Telemekh., 2004, no. 2,  55–68