Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070100200 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070100200 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:51, 9 December 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
