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.

Author Bio

I am a junior at the University of Pennsylvania, concentrating in Statistics and Finance and majoring in Electrical Engineering. This work was from a research of Dr. Hahn, who was the instructor of my undergraduate probability course. Having an immense interest in applying mathematics and statistics to real life situations, I expressed my interest in Dr. Hahn's research.