quadratic assignment problem
英[kwəˈdrætik əˈsainmənt ˈprɔbləm]美[kwɑˈdrætɪk əˈsaɪnmənt ˈprɑbləm]
The quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems.