Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Plyasunov, Aleksandr Vladimirovich

Statistics Math-Net.Ru
Total publications: 25
Scientific articles: 25

Number of views:
This page:1033
Abstract pages:8729
Full texts:2669
References:966
Associate professor
Doctor of physico-mathematical sciences
E-mail:
Website: https://www.math.nsc.ru/LBRT/k5/Plyasunov/plasun_win.html

https://www.mathnet.ru/eng/person28162
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/519098

Publications in Math-Net.Ru Citations
2022
1. S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov, “A model of economic policy making with transaction costs and breach-of-contract risk insurance”, Diskretn. Anal. Issled. Oper., 29:3 (2022),  45–63  mathnet  mathscinet
2. Yu. A. Kochetov, V. A. Legkokonets, A. A. Panin, A. V. Plyasunov, L. V. Som, “The problem of gas treatment and transportation”, Diskretn. Anal. Issled. Oper., 29:2 (2022),  5–23  mathnet  mathscinet
2021
3. O. A. Kutnenko, A. V. Plyasunov, “NP-hardness of some data cleaning problem”, Diskretn. Anal. Issled. Oper., 28:2 (2021),  60–73  mathnet; J. Appl. Industr. Math., 15:2 (2021), 285–291  scopus
2019
4. S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov, “The Stackelberg models in territorial planning”, Avtomat. i Telemekh., 2019, no. 2,  111–124  mathnet  elib 2
5. A. V. Kononov, A. A. Panin, A. V. Plyasunov, “A bilevel competitive location and pricing model with nonuniform split of demand”, Diskretn. Anal. Issled. Oper., 26:3 (2019),  27–45  mathnet; J. Appl. Industr. Math., 13:3 (2019), 500–510  scopus 4
6. A. V. Gubareva, A. A. Panin, A. V. Plyasunov, L. V. Som, “On a three-level competitive pricing problem with uniform and mill pricing strategies”, Diskretn. Anal. Issled. Oper., 26:1 (2019),  55–73  mathnet; J. Appl. Industr. Math., 13:1 (2019), 54–64  scopus 1
2017
7. Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov, “Genetic local search and hardness of approximation for the server load balancing problem”, Avtomat. i Telemekh., 2017, no. 3,  51–62  mathnet  mathscinet  elib; Autom. Remote Control, 78:3 (2017), 425–434  isi  scopus 4
2016
8. S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov, “Comparison of models of planning public-private partnership”, Diskretn. Anal. Issled. Oper., 23:3 (2016),  35–60  mathnet  mathscinet  elib; J. Appl. Industr. Math., 10:3 (2016), 356–369  scopus 18
2015
9. S. M. Lavlinskii, A. A. Panin, A. V. Plyasunov, “A bilevel planning model for public-private partnership”, Avtomat. i Telemekh., 2015, no. 11,  89–103  mathnet  elib; Autom. Remote Control, 76:11 (2015), 1976–1987  isi  elib  scopus 20
10. Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov, “Comparison of metaheuristics for the bilevel facility location and mill pricing problem”, Diskretn. Anal. Issled. Oper., 22:3 (2015),  36–54  mathnet  mathscinet  elib; J. Appl. Industr. Math., 9:3 (2015), 392–401 22
2014
11. A. A. Panin, M. G. Pashchenko, A. V. Plyasunov, “Bilevel competitive facility location and pricing problems”, Avtomat. i Telemekh., 2014, no. 4,  153–169  mathnet; Autom. Remote Control, 75:4 (2014), 715–727  isi  scopus 38
12. A. A. Panin, A. V. Plyasunov, “On complexity of bilevel problems of location and pricing”, Diskretn. Anal. Issled. Oper., 21:5 (2014),  54–66  mathnet  mathscinet; J. Appl. Industr. Math., 8:4 (2014), 574–581 9
2012
13. A. V. Plyasunov, A. A. Panin, “The pricing problem. Part 2. The computational complexity”, Diskretn. Anal. Issled. Oper., 19:6 (2012),  56–71  mathnet  mathscinet; J. Appl. Industr. Math., 7:3 (2013), 420–430 16
14. A. V. Plyasunov, A. A. Panin, “The pricing problem. Part I. Exact and approximate algorithms”, Diskretn. Anal. Issled. Oper., 19:5 (2012),  83–100  mathnet  mathscinet; J. Appl. Industr. Math., 7:2 (2013), 241–251 17
15. Yu. A. Kochetov, A. V. Plyasunov, “Genetic local search the graph partitioning problem under cardinality constraints”, Zh. Vychisl. Mat. Mat. Fiz., 52:1 (2012),  164–176  mathnet  mathscinet  zmath  elib; Comput. Math. Math. Phys., 52:1 (2012), 157–167  isi  elib  scopus 7
2009
16. A. V. Kononov, Yu. A. Kochetov, A. V. Plyasunov, “Competitive facility location models”, Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1037–1054  mathnet  zmath; Comput. Math. Math. Phys., 49:6 (2009), 994–1009  isi  scopus 25
2007
17. D. S. Ivanenko, A. V. Plyasunov, “О сводимости задач двухуровневого программирования к задачам векторной оптимизации”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  72–99  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 2:2 (2008), 179–195  scopus 5
2005
18. Yu. A. Kochetov, M. G. Pashchenko, A. V. Plyasunov, “On the complexity of local search in the $p$-median problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005),  44–71  mathnet  mathscinet  zmath 10
2004
19. D. S. Ivanenko, A. V. Plyasunov, “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  mathnet  mathscinet 1
2003
20. A. V. Plyasunov, “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  mathnet  mathscinet  zmath 3
2002
21. Yu. A. Kochetov, A. V. Plyasunov, “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  mathnet  mathscinet  zmath 3
2000
22. A. V. Plyasunov, “A polynomially solvable class of two-level nonlinear programming problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000),  89–113  mathnet  mathscinet  zmath 2
1997
23. Yu. A. Kochetov, A. V. Plyasunov, “A polynomially solvable class of two-level linear programming problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 4:2 (1997),  23–33  mathnet  mathscinet 7
1979
24. A. V. Plyasunov, “Splinters and turing degrees”, Mat. Zametki, 25:2 (1979),  307–310  mathnet  mathscinet  zmath; Math. Notes, 25:2 (1979), 158–159  isi

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024