Algorithms for solution of the assignment problem

The well-known assignment problem is considered. Algorithms oriented to specific subclasses of initial matrices are proposed for solution. Estimates are constructed for estimating the computer load of the algorithms which are significantly better thair conventional algorithms for problems with initial matrices of certain types.