1. Zabudskii, G.G. and Lagzdin, A.Yu., Dynamic Programming for the Quadratic Assignment Problem on Trees, Autom. Remote Control, 2012, vol. 73, no. 2, pp. 336–348.
2. Sergeev, S.I., The Quadratic Assignment Problem. I. New Lower Bounds in a Dual Assignment Scheme, Autom. Remote Control, 1999, vol. 60, no. 8, pp. 1162–1178.
3. Sergeev, S.I., The Quadratic Assignment Problem. II. Refined Gilmore–Lawler Algorithm, Autom. Remote Control, 1999, vol. 60, no. 9, pp. 1326–1331.
4. Muldoon, F., Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables, Clemson: Clemson Univ., 2012.
5. Saito, H. and Fujie, T., A Study of the Quadratic Semi-Assignment Polytope, Discret. Optim., 2009, vol. 6, pp. 37–50.