Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities

Frederick S. Hillier and Michael M. Connors
Additional contact information
Frederick S. Hillier: Stanford University
Michael M. Connors: Stanford University

Management Science, 1966, vol. 13, issue 1, 42-57

Abstract: This paper discusses the problem of assigning locations to indivisible facilities and its relation to the quadratic assignment problem. It also develops two suboptimal algorithms, one dealing with the general quadratic assignment problem and the other with an interesting special case. Qualitative and quantitative comparisons with existing suboptimal algorithms are presented.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.1.42 (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:inm:ormnsc:v:13:y:1966:i:1:p:42-57

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().