A bilinear programming solution to the quadratic assignment problem

Johan Kaashoek and Jean Paelinck

No EI 9956-/A, Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute

Abstract: 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 (search for similar items in EconPapers)
Date: 1999-12-22
References: Add references at CitEc
Citations:

Downloads: (external link)
https://repub.eur.nl/pub/1629/feweco19991222153952.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ems:eureir:1629

Access Statistics for this paper

More papers in Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute Contact information at EDIRC.
Bibliographic data for series maintained by RePub ( this e-mail address is bad, please contact ).