Suboptimal algorithms for the quadratic assignment problem

G. K. Gaschütz and J. H. Ahrens

Naval Research Logistics Quarterly, 1968, vol. 15, issue 1, 49-62

Abstract: The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800150105

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:wly:navlog:v:15:y:1968:i:1:p:49-62

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().