This document describes a quadratic assignment problem (QAP) involving assigning 358 constraints and 50 variables. It provides an example of a QAP with 3 facilities and 3 locations. The QAP aims to assign facilities to locations in a way that minimizes total cost, which is a function of the flow between facilities and the distance between locations. Several applications of QAP are discussed, including facility location, scheduling, and ergonomic design problems.