Finding minimum-cost flows by double scaling (Q1184348)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 34348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding minimum-cost flows by double scaling |
scientific article; zbMATH DE number 34348 |
Statements
Finding minimum-cost flows by double scaling (English)
0 references
28 June 1992
0 references
transportation
0 references
minimum-cost circulations
0 references
minimum-cost flow problem
0 references
capacity-scaling
0 references
excess-scaling
0 references
dynamic tree data structure
0 references
cost- scaling
0 references
0.9192566871643066
0 references
0.9185213446617126
0 references
0.8906548619270325
0 references
0.8887479305267334
0 references
