Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541)
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 1547196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax regret solutions for minimax optimization problems with uncertainty |
scientific article; zbMATH DE number 1547196 |
Statements
Minmax regret solutions for minimax optimization problems with uncertainty (English)
0 references
22 July 2002
0 references
optimization under uncertainty
0 references
polynomial algorithms
0 references
minmax regret optimization
0 references
0 references
0.8862324953079224
0 references
0.8627849221229553
0 references
0.8399967551231384
0 references
0.8280276656150818
0 references
0.8232528567314148
0 references
