General forms of the quadratic assignment problem

Salih O. Duffuaa and Chawki A. Fedjki

International Journal of Operational Research, 2012, vol. 13, issue 2, 185-199

Abstract: In this paper, a general model has been formulated for facility location. The proposed model allows for locating several facilities in a single location, and as such, it is therefore a generalisation of the well-known quadratic assignment problem (QAP) and other variants. The general model has a wide range of applications in facility location, operations research and business. A branch-and-bound algorithm is developed for the generalised quadratic semi-assignment problem (GQSAP), which is a special form of the general model. The branch-and-bound algorithm is based on a modified version of the well-known Gilmore bound. Computational results are presented to corroborate the theoretical model developed here.

Keywords: QAP; quadratic assignment problem; facility location; clustering problem; QSAP; quadratic semi-assignment problem; operational research; branch and bound. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=45186 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:13:y:2012:i:2:p:185-199

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().