Sobolev Institute of
Laboratory "Mathematical Models of Decision Making"
Name: Alexander Plyasunov
Date of birth: 25.06.1954
Place of birth: Karaganda, Russia
Marital status: divorcee
PhD in Mathematics and Physics, Sobolev Institute of Mathematics, 2002.
PhD Thesis: Bilevel Programming Problems Polynomially Solvabled by Decomposition.
Abstract 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.
2002 - date: senior researcher of the Sobolev Institute of Mathematics;
1990 - date: associate professor of the Novosibirsk State University
1986 - 2002: research fellow of the Sobolev Institute of Mathematics;
1976 - 1986: engineer of the Sobolev Institute of Mathematics;
Akademika Koptyuga pr.4,
Sobolev Institute of Mathematics,
Novosibirsk, 630090, Russia.
Phone: +7 383 333 20 86,
Fax: +7 383 333 25 98
- Discrete location problems,
- Long range strategic planning,
- Bilevel programming,
- Metaheuristics, randomized algorithms,
- Decision support systems.
Novosibirsk State University
Lecturies: Operations Research, Optimization Methods.
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. 1122.
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. 9941009.
Ivanenko D., Plyasunov A. Reducibility of bilevel programming problems to vector optimization problems // Journal of Applied and Industrial Mathematics, 2008, V. 2(2), P. 179195.
E. Alekseeva, Yu. Kochetov, A. Plyasunov. Complexity of local search for the p-median problem // European Journal of Operational Research 191 (2008) 736752.
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).
, 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.