On the computational behavior of a polynomial-time network flow algorithm (Q1190598)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational behavior of a polynomial-time network flow algorithm |
scientific article |
Statements
On the computational behavior of a polynomial-time network flow algorithm (English)
0 references
26 September 1992
0 references
A variation on the Edmonds-Karp scaling approach to the minimum cost network flow problem is examined. This algorithm, which scales costs rather than right-hand sides, also runs in polynomial time. Large-scale computational experiments indicate that the computational behaviour of this scaling algorithms is much better than had been presumed.
0 references
minimum cost network flow
0 references
scaling algorithms
0 references
