An algorithm for then×n optimum assignment problem (Q3890004)
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: An algorithm for then×n optimum assignment problem |
scientific article; zbMATH DE number 3696375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for then×n optimum assignment problem |
scientific article; zbMATH DE number 3696375 |
Statements
An algorithm for then×n optimum assignment problem (English)
0 references
1979
0 references
optimum assignment
0 references
systematic permutations
0 references
algorithm
0 references
cycles
0 references
cost
0 references
0 references
0 references
