The Quadratic Assignment Problem (QAP) is a discrete optimization
problem which can be found in economics, operations research, and
engineering. It seeks to locate N facilities among N fixed locations
in the most economical way. This paper gives a brief introduction to
QAP and discusses how to reduce the problem size to N-1 if the
original problem satisfies certain conditions.