THE QUADRATIC ASSIGNMENT PROBLEM : SOME NEW RESULT AND GENERALIZATION

Abstract

The Quadratic assignment problem is a combinatorial problem of
deciding the placement of facilities in specified locations in such a way
as to minimize an function expressed in terms of distances between
locations and flows between facilities. The approach presented in this
paper is to treat is as a large quadratic programming problem with
integer resfictions on the variables. The integer requirements are
initially relaxed, and the nearest feasible solutions in then sought.
schemes for accomplishing this are described, and their applicability to
more general problems is discussed.