The Journal of the Operational Research Society, Vol. 36, No. 2 (Feb., 1985), pp. 163-167 (5 pages) A technique is described whereby the computational efficiency of the Lashkari-Jaisingh heuristic for ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback