On dual minimum cost flow algorithms (Q1396922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On dual minimum cost flow algorithms |
scientific article; zbMATH DE number 1949074
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On dual minimum cost flow algorithms |
scientific article; zbMATH DE number 1949074 |
Statements
On dual minimum cost flow algorithms (English)
0 references
14 July 2003
0 references
minimum cost flow problem
0 references
strongly polynomial algorithm
0 references
dual algorithms
0 references
cut cancelling
0 references
dual network simplex
0 references
0.97605115
0 references
0.9365118
0 references
0.9315529
0 references
0.9274219
0 references
0.9006401
0 references
0.89926004
0 references
0.89461577
0 references
0.8925729
0 references
