Finding minimum-cost flows by double scaling (Q1184348): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59592661, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59592661 / rank | |||
Normal rank | |||
Revision as of 00:17, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding minimum-cost flows by double scaling |
scientific article |
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
