A comparison of two algorithms for the assignment problem (Q1804373)
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 comparison of two algorithms for the assignment problem |
scientific article; zbMATH DE number 754928
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of two algorithms for the assignment problem |
scientific article; zbMATH DE number 754928 |
Statements
A comparison of two algorithms for the assignment problem (English)
0 references
1 April 1996
0 references
auction algorithm
0 references
parallel computing
0 references
shortest augmenting path
0 references
linear assignment problem
0 references
0 references
0 references
