Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

To construct the asymptotically optimum plan of the p-index axial assignment problem of order n, p algorithms ?0, ?1, ..., ? p?1 with complexities equal to O(np+1), O(np), ..., O(n2) operations, respectively, are proposed and substantiated under some additional conditions imposed on the coefficients of the objective function.