On the complexity of the assignment problem with ordinal data (Q5212376)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7159554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the assignment problem with ordinal data |
scientific article; zbMATH DE number 7159554 |
Statements
28 January 2020
0 references
assignment problem
0 references
combinatorial optimization
0 references
computational complexity
0 references
polynomial algorithms
0 references
ordinal data
0 references
0.7665795087814331
0 references
0.7550409436225891
0 references
0.7550287246704102
0 references
0.7532094717025757
0 references
0.7429589629173279
0 references
