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. …

Krystian Boruciński

Full Stack Developer at Sandstream Development

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store