Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933)
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: Min-max and min-max regret versions of combinatorial optimization problems: A survey |
scientific article; zbMATH DE number 5549981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min-max and min-max regret versions of combinatorial optimization problems: A survey |
scientific article; zbMATH DE number 5549981 |
Statements
Min-max and min-max regret versions of combinatorial optimization problems: A survey (English)
0 references
30 April 2009
0 references
min-max
0 references
min-max regret
0 references
combinatorial optimization
0 references
complexity
0 references
approximation
0 references
robustness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8724649548530579
0 references
0.8673359751701355
0 references
0.8408485651016235
0 references
0.8399967551231384
0 references
0.8294539451599121
0 references
