The Quadratic Assignment Problem is one of the fundamental problems from the group of combinatorial optimization problems. It is an NP-hard problem, i.e. one for which finding an optimal solution is impossible in polynomial time. This problem appears in many practical issues in economics, ergonomics, electronics, architecture, and IT. First introduced by Koopmans and Beckmann in 1957.
The problem models the following real-life problem:
There are n facilities and the same amount of locations. The distances between the cities and the flows between the facilities are known. …
Full Stack Developer at Sandstream Development