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