Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137)
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 1588392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks |
scientific article; zbMATH DE number 1588392 |
Statements
Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (English)
0 references
2001
0 references
Negative cycle canceling algorithm
0 references
Minimum ratio cycle
0 references
Linear programming problem
0 references
Unimodular linear space
0 references
Minimum cost flow
0 references
minimum cost tension
0 references
0 references
0 references
0 references
0 references
0.8189950585365295
0 references
0.8058180809020996
0 references
0.8024349808692932
0 references
0.8024349808692932
0 references
