| Article ID: | iaor19981365 |
| Country: | Netherlands |
| Volume: | 80 |
| Issue: | 2 |
| Start Page Number: | 418 |
| End Page Number: | 424 |
| Publication Date: | Jan 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | White D.J. |
| Keywords: | programming: quadratic, programming: nonlinear |
The quadratic assignment problem suffers from the non-convex, non-concave form of its objective function. In this paper, five alternative representations of the problem are given, whose convexity-concavity properties can, in principle, be exploited to some advantage.