A Faster Strongly Polynomial Minimum Cost Flow Algorithm (Q5288156)
From MaRDI portal
scientific article; zbMATH DE number 243546
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Faster Strongly Polynomial Minimum Cost Flow Algorithm |
scientific article; zbMATH DE number 243546 |
Statements
A Faster Strongly Polynomial Minimum Cost Flow Algorithm (English)
0 references
9 August 1993
0 references
strongly polynomial time algorithm
0 references
minimum cost flow
0 references
scaling
0 references
uncapacitated minimum cost flow
0 references
shortest path
0 references
