Abstract:
In this paper procedure of reduction used by some methods of search of the exact solution of assignments problem and problems of the traveling salesman is considered. The conception of optimal reduction of the matrix, providing a maximum of the sum of reduction constants is offered and its some properties are discussed.