The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies

Robin Segerblom Liggett
Additional contact information
Robin Segerblom Liggett: University of California, Los Angeles

Management Science, 1981, vol. 27, issue 4, 442-458

Abstract: Since procedures for producing optimal solutions to a quadratic assignment problem are computationally infeasible for any but small problems, heuristic techniques for producing approximate solutions must be employed for the solution of real practical problems. This paper presents the results of experimentation that demonstrates that a solution procedure which couples a constructive initial placement technique with simple and inexpensive improvement procedures produces good solutions with very reasonable computation requirements. The results indicate that such an approach would make the solution of large-scale quadratic assignment problems feasible.

Keywords: quadratic; assignment; problem (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.27.4.442 (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:27:y:1981:i:4:p:442-458

Access Statistics for this article

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