A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming (Q4018386): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0802006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072653654 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:15, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming |
scientific article |
Statements
A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming (English)
0 references
16 January 1993
0 references
long-step path-following algorithm
0 references
