Towards a Genuinely Polynomial Algorithm for Linear Programming (Q3315270): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0212022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002636386 / rank | |||
Normal rank | |||
Latest revision as of 21:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards a Genuinely Polynomial Algorithm for Linear Programming |
scientific article |
Statements
Towards a Genuinely Polynomial Algorithm for Linear Programming (English)
0 references
1983
0 references
convex minimization
0 references
computational complexity
0 references
genuinely polynomial algorithm
0 references
linear inequalities
0 references
at most two variables per inequality
0 references
binary search
0 references
