Podolsky, S.V.; Zorin, Yu.M.
(Системні дослідження та інформаційні технології, 2015)
The quadratic assignment problem is rightfully considered to be one of the most challenging problems of combinatorial optimization. Since this problem is NP-hard, the use of heuristic algorithms is the only way to find in ...