Minimum-cost flows in unit-capacity networks (Q1693987)
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: Minimum-cost flows in unit-capacity networks |
scientific article; zbMATH DE number 6833237
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-cost flows in unit-capacity networks |
scientific article; zbMATH DE number 6833237 |
Statements
Minimum-cost flows in unit-capacity networks (English)
0 references
1 February 2018
0 references
algorithms
0 references
minimum-cost flows
0 references
bipartite matching
0 references
assignment problem
0 references
0.9369216
0 references
0.9350658
0 references
0.93107307
0 references
0.9220207
0 references
