General forms of the quadratic assignment problem
by Salih O. Duffuaa; Chawki A. Fedjki
International Journal of Operational Research (IJOR), Vol. 13, No. 2, 2012

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.

Online publication date: Sun, 11-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com