A bilinear programming solution to the quadratic assignment problem
AbstractThe 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 (seePaelinck, 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 9956-/A.
Date of creation: 22 Dec 1999
Date of revision:
Contact details of provider:
Web page: http://www.few.eur.nl/few
maximal acyclical graph; quadratic assignment problem QAP;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If references are entirely missing, you can add them using this form.