Does anyone know a good algorithm for quickly finding an approximate solution to the following problem?

Given two square matrices $A$ and $B$, minimize $\| P A P^\top - B \|$ over all permutation matrices $P$.

I have heard that there are several types of algorithms for these kinds of problems, like iterative improvement, simulated annealing, tabu search, genetic algorithms, evolution strategies, ant algorithms, and scatter search. I am looking for existing software.


closed as off-topic by D.W. Jul 20 '16 at 21:16

  • This question does not appear to be about computer science within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.

  • 1
    $\begingroup$ This question may be better suited to scicomp.stackexchange.com since you are looking for a particular piece of software. $\endgroup$ – Kaya Dec 26 '13 at 17:22
  • $\begingroup$ I'm voting to close this question, even though it is on-topic here, because it was cross-posted on Computational Science. Go there to answer or see what others have suggested. $\endgroup$ – D.W. Jul 20 '16 at 21:16