Solution 8 Computational Intelligence Lab 2013

Aus VISki
Wechseln zu: Navigation, Suche

Problem 1

  • Question: Find the permutation such that the approximation is minimal

Copied solution from discussion:

the first term is constant and we can neglect it in our minimization therefore we only have
since is only 1 if (and 0 otherwise) and this can only be the case at most for one pair of i and j, we only need one sum and since K' < K we have to sum over K'.
obviously this is maximized, if we keep the largest values.