The worst-case running time of the random simplex algorithm is exponential in the height (Q671935)
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: The worst-case running time of the random simplex algorithm is exponential in the height |
scientific article; zbMATH DE number 984689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The worst-case running time of the random simplex algorithm is exponential in the height |
scientific article; zbMATH DE number 984689 |
Statements
The worst-case running time of the random simplex algorithm is exponential in the height (English)
0 references
27 February 1997
0 references
Linear programming
0 references
Algorithms
0 references
Simplex algorithm
0 references
Randomized algorithm
0 references
0.8479211
0 references
0.81969905
0 references
0.8102912
0 references
0.8098848
0 references
0.8049916
0 references
0 references
0.7993151
0 references
0.7973236
0 references
