Plyasunov Aleksandr Vladimirovich

Publications in Math-Net.Ru

1. Public-private partnership concerning infrastructure projects in a resource region: A model based on a consortium of subsoil users
   
   Diskretn. Anal. Issled. Oper., 32:1 (2025),  48–74
2. Variable neighborhood descent for finding the threshold stability radius in the facility location and discriminatory pricing problem
   
   Diskretn. Anal. Issled. Oper., 31:4 (2024),  116–133
3. A study of the threshold stability of the bilevel problem of facility location and discriminatory pricing
   
   Diskretn. Anal. Issled. Oper., 31:3 (2024),  79–104
4. A model of economic policy making with transaction costs and breach-of-contract risk insurance
   
   Diskretn. Anal. Issled. Oper., 29:3 (2022),  45–63
5. The problem of gas treatment and transportation
   
   Diskretn. Anal. Issled. Oper., 29:2 (2022),  5–23
6. NP-hardness of some data cleaning problem
   
   Diskretn. Anal. Issled. Oper., 28:2 (2021),  60–73
7. The Stackelberg models in territorial planning
   
   Avtomat. i Telemekh., 2019, no. 2,  111–124
8. A bilevel competitive location and pricing model with nonuniform split of demand
   
   Diskretn. Anal. Issled. Oper., 26:3 (2019),  27–45
9. On a three-level competitive pricing problem with uniform and mill pricing strategies
   
   Diskretn. Anal. Issled. Oper., 26:1 (2019),  55–73
10. Genetic local search and hardness of approximation for the server load balancing problem
    
    Avtomat. i Telemekh., 2017, no. 3,  51–62
11. Comparison of models of planning public-private partnership
    
    Diskretn. Anal. Issled. Oper., 23:3 (2016),  35–60
12. A bilevel planning model for public-private partnership
    
    Avtomat. i Telemekh., 2015, no. 11,  89–103
13. Comparison of metaheuristics for the bilevel facility location and mill pricing problem
    
    Diskretn. Anal. Issled. Oper., 22:3 (2015),  36–54
14. Bilevel competitive facility location and pricing problems
    
    Avtomat. i Telemekh., 2014, no. 4,  153–169
15. On complexity of bilevel problems of location and pricing
    
    Diskretn. Anal. Issled. Oper., 21:5 (2014),  54–66
16. The pricing problem. Part 2. The computational complexity
    
    Diskretn. Anal. Issled. Oper., 19:6 (2012),  56–71
17. The pricing problem. Part I. Exact and approximate algorithms
    
    Diskretn. Anal. Issled. Oper., 19:5 (2012),  83–100
18. Genetic local search the graph partitioning problem under cardinality constraints
    
    Zh. Vychisl. Mat. Mat. Fiz., 52:1 (2012),  164–176
19. Competitive facility location models
    
    Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1037–1054
20. О сводимости задач двухуровневого программирования к задачам векторной оптимизации
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  72–99
21. On the complexity of local search in the $p$-median problem
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005),  44–71
22. On Lagrangian relaxations for the problem of the choice of a series of goods with partial external financing and constraints on product volume
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 11:2 (2004),  69–93
23. A two-level linear programming problem with a multivariant knapsack at the lower level
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 10:1 (2003),  44–52
24. The problem of the choice of a series of goods with partial external financing
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002),  78–96
25. A polynomially solvable class of two-level nonlinear programming problems
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000),  89–113
26. A polynomially solvable class of two-level linear programming problems
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 4:2 (1997),  23–33
27. Splinters and turing degrees
    
    Mat. Zametki, 25:2 (1979),  307–310