Sobolev Institute of Mathematics
Laboratory "Mathematical Models of Decision Making"

Speckled_Gradient21A5.gif (2795 bytes)

Dr. Alexander Plyasunov  
Senior researcher, associate professor


Work Phone: +7 383 329 75 81,

ballblue.gif (80 bytes) Russian page

ballblue.gif (80 bytes) Curriculum Vitae

ballblue.gif (80 bytes) Research interests

ballblue.gif (80 bytes) Teaching

ballblue.gif (80 bytes) Publications

Speckled_Gradient21A5.gif (2795 bytes)

Curriculum Vitae

Name: Alexander Plyasunov
Date of birth: 25.06.1954
Place of birth: Karaganda, Russia
Marital status: divorcee
Nationality: Russian


PhD in Mathematics and Physics, Sobolev Institute of Mathematics, 2002.
PhD Thesis: Bilevel Programming Problems Polynomially Solvabled by Decomposition.
  ps-file in Russian (173 Kb)      Complete text   ps-file in Russian (768 Kb)   
Advisor: Prof. Vladimir L.Beresnev and Dr.Yuri Kochetov

M.D. in Applied Mathematics, Novosibirsk State University, 1976.



Akademika Koptyuga pr.4,
Sobolev Institute of Mathematics,
Novosibirsk, 630090, Russia.
Phone: +7 383  333 20 86,
Fax:    +7 383 333 25 98


Speckled_Gradient21A5.gif (2795 bytes)

Research interests

Speckled_Gradient21A5.gif (2795 bytes)


Novosibirsk State University
Lecturies: Operations Research, Optimization Methods.

Speckled_Gradient21A5.gif (2795 bytes)

Last Publications

  • D.D. Čvokić,Y.A. Kochetov, and A.V. Plyasunov. The Existence of Equilibria in the Leader-Follower Hub Location and Pricing Problem // Doerner, K., Ljubic, I., Pflug, G., Tragler, G. (Eds.) Operations Research Proceedings 2015. Springer 2017 (pdf.file 115 Kb)

  • Kochetov, Y.A., Panin, A.A., Plyasunov, A.V. Genetic local search and hardness of approximation for the server load balancing problem // Automation and Remote Control. 2017. Vol. 78 N 3. P. 425-434.
    DOI: 10.1134/S0005117917030043

  • Čvokić, D.D., Kochetov, Y.A., Plyasunov, A.V. A leader-follower hub location problem under fixed markups // Yu. Kochetov (Eds.) 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016;  LNCS Vol. 9869. 2016. P. 350-363.  DOI: 10.1007/978-3-319-44914-2_28 (pdf.file 250 Kb)

  • Kochetov, Y.A., Panin, A.A., Plyasunov, A.V. Genetic local search for the servers load balancing problem // CEUR Workshop Proceedings 2016. Vol. 1623, ń. 453-463

  • Kochetov Yu.A., Panin A.A., Plyasunov A.V. Comparison of metaheuristics for the bilevel facility location and mill pricing problem // Journal of Applied and Industrial Mathematics 2015. Vol. 9, N 3. P 392-401. DOI 10.1134/S1990478915030102

    Lavlinskii S.M., Panin A.A., Plyasunov A.V. A bi-level planning model for public-private partnership// Automation and Remote Control, 2015. Vol. 76.-No. 11.- P. 1588–1599. DOI 10.1134/S0005117915110077

  • A.A. Panin, M. G. Pashchenko, and A. V. Plyasunov}  Bilevel Competitive Facility Location and Pricing Problems // Automation and Remote Control, 2014, Vol. 75, No. 4, pp. 715–727. DOI:10.1134/S0005117914040110

  • Kochetov Yu.A. and Plyasunov A.V. Genetic Local Search the Graph Partitioning Problem under Cardinality Constraints // Computational Mathematics and Mathematical Physics. 2012. Vol.52, N 1. P. 157–167.
    DOI: 10.1134/S096554251201006X  (pdf-file 251 Kb)

  • Plyasunov A.V., Panin A.A. Computational complexity and decomposition algorithms for the mill pricing problem  // International Conference Optimization and Applications (OPTIMA-2011), Petrovac, Montenegro, 2011. P.46

  • E. Alekseeva, N. Kochetova, Y. Kochetov, A. Plyasunov. Heuristic and Exact Methods for the Discrete (r | p)-Centroid Problem // P. Cowling and P. Merz (Eds.): EvoCOP 2010, Lecture Notes in Computer Science 6022, Springer, Heidelberg, 2010. – P. 11–22.

  • Kochetov Yu., Mikhailova A., Plyasunov A. A. Genetic Local Search Algorithm for the Graph Partitioning Problem with Cardinality Constraints // Preprints of the 13th IFAC Symposium on Information Control Problems in Manufacturing (INCOM09), Moscow, Russia, June 3 - 5, 2009. P. 1991-1996.

  • Alekseeva E., Kochetova N., Kochetov Y., Plyasunov A. A Hybrid Memetic Algorithm for the Competitive p-Median Problem // Preprints of the 13th IFAC Symposium on Information Control Problems in Manufacturing, Moscow, Russia, June 3 - 5, 2009. P. 1516-1520

  • Kononov A.V., Kochetov Yu. A.,  Plyasunov A.V. Competitive Facility Location Models // Computational Mathematics and Mathematical Physics, 2009, Vol. 49, No. 6, pp. 994–1009.

  • Ivanenko D., Plyasunov A.  Reducibility of bilevel programming problems to vector optimization problems // Journal of Applied and Industrial Mathematics, 2008, V. 2(2),  P. 179–195.

  • E. Alekseeva, Yu. Kochetov, A. Plyasunov. Complexity of local search for the p-median problem // European Journal of Operational Research 191 (2008) 736–752.

  • Yu. Kochetov, A. Pljasunov, and M. Pashchenko.  On complexity of local search for the p-median problem // Discrete Analysis and Operations Research, Series 2, 2005 V.12, N 2, P. 44-71. (In Russian).

  • E. Alekseeva, Yu. Kochetov, A. Plyasunov. Complexity of local search for the p-median problem // Proceedings of 18th Mini Euro Conference on VNS. 2005

  • Yu. Kochetov, A. Pljasunov. Local Search in Combinatorial Optimization. What About the Derivative? // Proceeding of 13-th Baikal international School-seminar. V.1 Mathematical programming. Irkutsk. 2005. p. 65-75. (in Russian).

  • Ivanenko D.S., Plyasunov A.V. Lower and upper bounds for the bilevel capacitated facility location problem with partial external finance // Discrete Optimization Methods in Production and Logistics. Proceedings of the Second International Workshop. Omsk – Irkutsk, Russia, 2004. Ńņš. 56-60.

  • A.Plyasunov. The bilevel Programming Problem with Multiple-Choice Knapsack Problem in Lower Level. Discrete Analysis and Operations Research, series 2, 10(1), 2003, (in Russian).

  • Yu.Kochetov and A.Plyasunov. The Uncapacitated Facility Location Problem with Partial External Finance. Discrete Analysis and Operations Research, series 2, 9(2), 2002, 78-96 (in Russian).

  • A.Plyasunov. An Approach to solving the bilevel programming problem. Proceedings of 12-th Baikal International Conference, Irkutsk, 2001, v 1, 227-231 (in Russian).

  • A.Plyasunov. A polynomially solvable case for the nonlinear bilevel programming problem. Discrete Analysis and Operations Research, series 2, 7(2), 2000, 89-113 (in Russian).

  • N.Glebov, Yu.Kochetov, and A.Plyasunov, Optimization Methods, Novosibirsk, NSU, 2000 (in Russian)

  • Pljasunov A. A polynomially solvable case of the nonlinear bilevel programming problem. Operations Research Proceedings 1997, Springer-Verlag, Berlin, 1998.

  • Yu. Kochetov and A.Pljasunov, A Polynomially Solvable Case for the Bilevel Linear Programming Problems. Discrete Analysis and Operations Research, series 2, 4(2), 1997, 23-33, (in Russian)

  • Kochetov Yu., Pljasunov A. Efficient algorithm for a class of bilevel linear Programming problems. Operations Research Proceedings 1996, Springer-Verlag, Berlin, 1997, p.10-13.


Speckled_Gradient21A5.gif (2795 bytes)


Update 21.02.18