This is a Python implementation of the Doubly Stochastic Projected Fixed Point (DSPFP) algorithm for solving the Quadratic Assignment Problem / Graph Matching..

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

Abstract: Meta-heuristic algorithms have been used to obtain feasible solutions in reasonable time for many NP-hard search problems. However, the performance of the algorithms heavily depends on the ...

Abstract: In this paper a particle swarm optimization algorithm is presented to solve the Quadratic Assignment Problem, which is a NP-Complete problem and is one of the most interesting and ...

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