Note on Weintraub’s Minimum-Cost Circulation Algorithm (Q3829324)
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 4104674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on Weintraub’s Minimum-Cost Circulation Algorithm |
scientific article; zbMATH DE number 4104674 |
Statements
Note on Weintraub’s Minimum-Cost Circulation Algorithm (English)
0 references
1989
0 references
minimum-cost circulation
0 references
convex cost function
0 references
linear objective function
0 references
polynomial time
0 references
scaling
0 references
maximum flow
0 references
augmenting path
0 references
residual graph
0 references
0.8225307464599609
0 references
0.8136762380599976
0 references
0.8122469186782837
0 references
