A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem (Q3991331)
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: A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem |
scientific article; zbMATH DE number 36780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem |
scientific article; zbMATH DE number 36780 |
Statements
A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem (English)
0 references
28 June 1992
0 references
shortest augmenting path algorithm
0 references
semi-assignment problem
0 references
0.9302894
0 references
0.92696434
0 references
0.87928325
0 references
0.8564135
0 references
0.8558685
0 references
0.8556596
0 references
0.85536516
0 references
