Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:31, 30 January 2024
scientific article; zbMATH DE number 1590534
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
