Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. (Q1852514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. |
scientific article; zbMATH DE number 1849230
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. |
scientific article; zbMATH DE number 1849230 |
Statements
Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. (English)
0 references
26 June 2003
0 references
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.
0 references
Multi-index choice problem
0 references
polynomial algorithm
0 references
optimal solution
0 references
order
0 references
operations
0 references
minimization
0 references
objective function
0 references
0.94258785
0 references
0.9156655
0 references
0.8998734
0 references
0.8962469
0 references
0.8813485
0 references
0.88011694
0 references
