QAPP

Quadratic assignment problems. All global solutions can be obtained

This is an exact algorithm based on branch and bound. In addition, the algorithm has been parallelized and implemented on shared memory machines. Research reports providing computational results and the theoretical basis for the algorithm are available on request. Software is written in Fortran using integer arithmetic in all cases.

Need more info?

Contact:

Professor Panos Pardalos 
303 Weil Hall 
Department of Industrial Engineering 
University of Florida 
Gainesville, FL 32611
pardalos@math.ufl.edu

References:

P. M. Pardalos and J. Crouse, A parallel algorithm for the quadratic assignment problem, Proc. of the Supercomputing 89 Conference, ACM Press, pp. 351--360.

P. M. Pardalos, K. Murthy, and Y. Li, Computational experience with parallel algorithms for solving the quadratic assignment problem, In Computer Science and Operations Research: New Developments in their Interface, O. Balci, R. Sharda, and S. Zenios, eds., Pergamon Press, 1992, pp. 267--278.

[ Optimization Software Guide | OTC Home Page | NEOS Server | NEOS Guide ]