Remark on the paper ``A polynomial algorithm for the multi-index choice problem'' (Q1608246)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1779281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Remark on the paper ``A polynomial algorithm for the multi-index choice problem'' |
scientific article; zbMATH DE number 1779281 |
Statements
Remark on the paper ``A polynomial algorithm for the multi-index choice problem'' (English)
0 references
12 August 2002
0 references
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.
0 references
planar choice problem
0 references
polynomial algorithm
0 references
minimum element method
0 references
optimal solution
0 references
counterexample
0 references
matrix
0 references
0.8421196341514587
0 references
0.836715817451477
0 references
0.7894928455352783
0 references
0.7546507120132446
0 references
