Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10288-012-0202-3 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044046971 / rank | |||
Revision as of 17:14, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min-max and min-max (relative) regret approaches to representatives selection problem |
scientific article |
Statements
Min-max and min-max (relative) regret approaches to representatives selection problem (English)
0 references
6 February 2013
0 references
uncertainty
0 references
min-max approach
0 references
min-max regret
0 references
computational complexity
0 references
dynamic programming
0 references
