Complexity of the min-max and min-max regret assignment problems (Q813974)
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: Complexity of the min-max and min-max regret assignment problems |
scientific article; zbMATH DE number 5003059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the min-max and min-max regret assignment problems |
scientific article; zbMATH DE number 5003059 |
Statements
Complexity of the min-max and min-max regret assignment problems (English)
0 references
2 February 2006
0 references
assignment problem
0 references
min-max
0 references
min-max regret
0 references
complexity
0 references
NP-hard
0 references
0 references
0.8115280270576477
0 references
0.8112281560897827
0 references
0.8094838261604309
0 references
0.802996039390564
0 references
