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 ...

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 ...

Some problems are so difficult that it takes a large network of enormously powerful computers to come up with a solution. Such a network, or computational grid, now has solved a challenging ...

A University of Iowa researcher has helped solve an applied mathematics problem that had challenged computer scientists for 40 years, just one year after he helped find the solution to a 32-year-old ...