A quadratic assignment problem without column constraints
MetadataShow full item record
We convert a quadratic assignment problem  with a nonconvex objective function into an integer linear program. We then solve the equivalent integer program by a simple enumeration that produces global minima.
The article of record as published may be found at http://dx.doi.org/10.1002/nav.3800160312
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.