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(n~(p+1)), O(n~p ), ... ,O(n~2) operations, respectively, are proposed and substantiated under some additional conditions imposed on the coefficients of the objective function.