A quadratic assignment problem without column constraints |
| |
Authors: | Harold Greenberg |
| |
Abstract: | We convert a quadratic assignment problem [1] 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. |
| |
Keywords: | |
|
|