Min max min robust (relative) regret combinatorial optimization (Q2216185)
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 7285839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min max min robust (relative) regret combinatorial optimization |
scientific article; zbMATH DE number 7285839 |
Statements
Min max min robust (relative) regret combinatorial optimization (English)
0 references
15 December 2020
0 references
minmax regret
0 references
robust programming
0 references
greedy algorithms
0 references
multiparametric programming
0 references
0 references
0 references
0 references
0 references
0.8631911277770996
0 references
0.8627849221229553
0 references
0.8408485651016235
0 references
0.8385828137397766
0 references
