Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137): Difference between revisions
From MaRDI portal
Latest revision as of 16:23, 3 June 2024
scientific article; zbMATH DE number 1588392
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
