Abstract.
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computational platforms. In this article we describe a novel approach to solve QAPs using a state-of-the-art branch-and-bound algorithm running on a federation of geographically distributed resources known as a computational grid. Solution of QAPs of unprecedented complexity, including the nug30, kra30b, and tho30 instances, is reported.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 29, 2000 / Accepted: June 5, 2001¶Published online October 2, 2001
Rights and permissions
About this article
Cite this article
Anstreicher, K., Brixius, N., Goux, JP. et al. Solving large quadratic assignment problems on computational grids. Math. Program. 91, 563–588 (2002). https://doi.org/10.1007/s101070100255
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101070100255