General forms of the quadratic assignment problem

Salih O. Duffuaa*, Chawki A. Fedjki

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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 wellknown Gilmore bound. Computational results are presented to corroborate the theoretical model developed here.

Original languageEnglish
Pages (from-to)185-199
Number of pages15
JournalInternational Journal of Operational Research
Volume13
Issue number2
DOIs
StatePublished - Jan 2012

Keywords

  • Branch and bound
  • Clustering problem
  • Facility location
  • Operational research
  • QAP
  • QSAP
  • Quadratic assignment problem
  • Quadratic semi-assignment problem

ASJC Scopus subject areas

  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'General forms of the quadratic assignment problem'. Together they form a unique fingerprint.

Cite this