One Method for Solution of the Problem of Optimal Permutation Estimation

Among the problems which cannot be solved in polynomial time there is a subclass of problems that can be solved by means of certain iterative process where each iteration is used to improve the result achieved by all the previous ones. Hence, provided there are some certain constraints for the criterion function (for instance, finiteness of it's range), there is a polynomial solution in some sense — the solution is linearly dependent on the potency of the range of this function. In this work one can find an example of such iterative algorithm