Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.
This paper is devoted to an algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. The authors propose and substantiate a new algorithm for solving the 3-planar choice problem of order \(n\) in \(O(n^4)\) operations under some additional conditions for the coefficients of the objective function.
scientific article; zbMATH DE number 1849230