Remark on the paper ``A polynomial algorithm for the multi-index choice problem''
type: Item
instance of: scholarly article
title: Remark on the paper ``A polynomial algorithm for the multi-index choice problem''
zbMATH Open document ID: 0998.68090
author: M. K. Kravtsov
author: A. P. Krachkovskij
published in: Computational Mathematics and Mathematical Physics
publication date: 2002-08-12T00:00:00Z
review text: In this paper the authors construct a counterexample showing that the method of minimum element builds a matrix which is not a plan in the \(p\)-index \((p>2)\) planar choice problem. Thus, the principal statement that the minimum element method almost always builds up an asymptotically optimal plan in the \(p\)-index planar choice problem is incorrect. Note that the authors have elaborated a new algorithm for obtaining an asymptotically optimal solution to the three-planar choice problem of order \(n\) in \(O(n^4)\) steps.
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1779281
zbMATH Keywords: planar choice problem
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: minimum element method
zbMATH Keywords: optimal solution
zbMATH Keywords: counterexample
zbMATH Keywords: matrix
reviewed by: A. Tret'yakov
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1779281