A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup> (Q4836755): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3137900 / rank | |||
Normal rank | |||
Latest revision as of 15:00, 23 May 2024
scientific article; zbMATH DE number 766364
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup> |
scientific article; zbMATH DE number 766364 |
Statements
A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup> (English)
0 references
21 June 1995
0 references
strongly polynomial algorithms
0 references
linear programming problems
0 references
perfect systems of linear inequalities
0 references
