A strongly polynomial time algorithm for an LP problem with a pre-Leontief coefficient matrix (Q5864876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7539884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial time algorithm for an LP problem with a pre-Leontief coefficient matrix |
scientific article; zbMATH DE number 7539884 |
Statements
10 June 2022
0 references
linear programming
0 references
network flow
0 references
strongly polynomial time algorithm
0 references
pre-Leontief and Leontief matrices
0 references
0.8044194579124451
0 references
0.7763665914535522
0 references
0.7505162954330444
0 references
0.74881911277771
0 references
0.7372572422027588
0 references
