Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities

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.

• 저널Management Science · 13(1) · 42–57
• 토픽Advanced Manufacturing and Logistics Optimization · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.13.1.42
• 저자Frederick S. Hillier, Michael M. Connors