Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724)
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 1590534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems |
scientific article; zbMATH DE number 1590534 |
Statements
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (English)
0 references
12 February 2002
0 references
linear programming
0 references
interior-point methods
0 references
probabilities analysis
0 references
0.8764235377311707
0 references
0.8686563968658447
0 references
0.8686560988426208
0 references
0.8567841649055481
0 references
0.8472012281417847
0 references
