Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


Sterten
Posts:
65
Registered:
12/13/04


optimal sorting
Posted:
Dec 7, 2012 1:47 PM


given a (symmetrical) finite real square matrix d(n,n) find a permutation s in S_n such that
SUM[i=2..n] ( min{d(s(i),s(j))0<j<i} ) is minimal
how is it called, how to solve it



