Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hillier et al. (1966) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: