An algorithm for solution of a minimax assignment problem with a sparce initial matrix

A new method is proposed for solution a minimax assignment problem. A theoretical effort consumption estimate is obtained and compared with the record estimate for available algorithms. Two modifications of this algorithm, important in applications, are provided.