A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (Q3731344)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm |
scientific article |
Statements
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (English)
0 references
1986
0 references
capacity-rounding algorithm
0 references
strongly polynomial algorithm
0 references
minimum-cost circulation problem
0 references
maximum flow
0 references
computational complexity
0 references
shortest path
0 references
