Dear all,(adsbygoogle = window.adsbygoogle || []).push({});

I have the following problem: I have a symmetric (non sparse) matrix, and I want to find the permutation of columns and rows that lead to have the smaller numbers in the diagonal.

Anyone has a clue on how to solve efficiently this kind of problems?

Thanks!

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Rearranging a matrix to get the minimum diagonal

**Physics Forums | Science Articles, Homework Help, Discussion**