Complexity of the min-max and min-max regret assignment problems (Q813974): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2004.12.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039863186 / rank | |||
Normal rank | |||
Revision as of 20:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the min-max and min-max regret assignment problems |
scientific article |
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
