Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883)
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: Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets |
scientific article |
Statements
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (English)
0 references
16 February 2018
0 references
robust optimization
0 references
minmax regret
0 references
ellipsoidal uncertainty
0 references
complexity
0 references
scenario relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0.9242872
0 references
0.91725206
0 references
0.91165096
0 references
0.9052918
0 references
0.9021555
0 references
0.9015642
0 references
0.90122414
0 references
0.89891154
0 references
0.8977369
0 references
