Date: Dec 7, 2012 1:47 PM
Author: Sterten
Subject: optimal sorting

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