 Quadratic assignment problem

The Quadratic Assignment Problem (QAP) is a classic problem in combinatorial optimization. It can be defined as follows: Imagine you have two sets: 1. A set of **n** facilities (like warehouses, factories, etc.). 2. A set of **n** locations (like sites or areas where the facilities can be placed).