A bilinear programming solution to the quadratic assignment problem
The quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and Wolkowicz, 1994). One of the authors has published some material, in which it was tried, by structuring the problem additionally, to bring it as closely as possible in the neighbourhood of a binary solution (see Paelinck, 1983, pp. 251-256 and 273-277); good but not optimal solutions could so be obtained (see Paelinck, 1985, pp. 247-254). The problem is taken up again here, in the same spirit but at the same time in a different vein.
|Keywords||maximal acyclical graph, quadratic assignment problem QAP|
Kaashoek, J.F., & Paelinck, J.H.P.. (1999). A bilinear programming solution to the quadratic assignment problem (No. EI 9956-/A). Retrieved from http://hdl.handle.net/1765/1629