A new scaling algorithm for the minimum cost network flow problem (Q1970413)
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: Publication:1970413 |
scientific article; zbMATH DE number 1419832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new scaling algorithm for the minimum cost network flow problem |
scientific article; zbMATH DE number 1419832 |
Statements
A new scaling algorithm for the minimum cost network flow problem (English)
0 references
12 December 2000
0 references
polynomial algorithm
0 references
excess scaling algorithm
0 references
0 references
0 references
0.8504981994628906
0 references
0.822403609752655
0 references
0.8187161087989807
0 references
0.8183644413948059
0 references
