The recurrent method to solve the assignment problem (Q269147)
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: The recurrent method to solve the assignment problem |
scientific article; zbMATH DE number 6569996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The recurrent method to solve the assignment problem |
scientific article; zbMATH DE number 6569996 |
Statements
The recurrent method to solve the assignment problem (English)
0 references
18 April 2016
0 references
assignment problem
0 references
matching
0 references
bipartite graph
0 references
augmenting path
0 references
0.8233726620674133
0 references
0.8209030032157898
0 references
0.8005136251449585
0 references
0.796340823173523
0 references
0.7930168509483337
0 references
