Finding minimum-cost flows by double scaling (Q1184348): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01585705 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075322358 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 30 July 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
