Speciality: 05.13.18 (Mathematical modelling, calculating methods, and the program systems)
E-mail:
Keywords: quadratic assignment problem, graphs, networks.
UDC: 519.7, 519.854
MSC: 90-XX

Subject:

Algorithms for solving the quadratic assignment problem in terms of graphs.

Main publications:

1. G. G. Zabudskii, A. Yu. Lagzdin, “Dynamic programming for the quadratic assignment problem on trees”, Autom. Remote Control, 73:2 (2012), 336–348              
2. G. G. Zabudsky, A. Yu. Lagzdin, “Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks”, Diskretn. Anal. Issled. Oper., 18:4 (2011), 49–65        
3. G. G. Zabudskii, A. Yu. Lagzdin, “Polynomial algorithms for solving the quadratic assignment problem on networks”, Comput. Math. Math. Phys., 50:11 (2010), 1948–1955                

Recent publications

Personal pages:

• 

Organisations:

• Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences