Mathematical Programming

, Volume 91, Issue 3, pp 563–588

Solving large quadratic assignment problems on computational grids

  • Kurt Anstreicher
  • Nathan Brixius
  • Jean-Pierre Goux
  • Jeff Linderoth
Article

DOI: 10.1007/s101070100255

Cite this article as:
Anstreicher, K., Brixius, N., Goux, JP. et al. Math. Program. (2002) 91: 563. doi:10.1007/s101070100255

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.

Key words: Quadratic assignment problem – branch and bound – computational grid – metacomputing Mathematics Subject Classification (1991): 90C27, 90C09, 90C20

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Kurt Anstreicher
    • 1
  • Nathan Brixius
    • 2
  • Jean-Pierre Goux
    • 3
  • Jeff Linderoth
    • 4
  1. 1.Department of Management Sciences, University of Iowa, Iowa City, IA 52242, USA, e-mail: kurt-anstreicher@uiowa.eduUS
  2. 2.Department of Computer Science, University of Iowa, Iowa City, IA 52242, USA, e-mail: brixius@cs.uiowa.eduUS
  3. 3.Department of Electrical and Computer Engineering, Northwestern University, and Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, Illinois 60439, USA, e-mail: goux@ece.nwu.eduUS
  4. 4.Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, Illinois 60439, USA, e-mail: linderot@mcs.anl.govUS