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

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                

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