A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems (Q3833847)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems |
scientific article |
Statements
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems (English)
0 references
1989
0 references
purely combinatorial strongly polynomial algorithm
0 references
minimum cost submodular flow
0 references
tree projection
0 references
scaling
0 references
