Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293)
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: Computing and minimizing the relative regret in combinatorial optimization with interval data |
scientific article; zbMATH DE number 5560498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing and minimizing the relative regret in combinatorial optimization with interval data |
scientific article; zbMATH DE number 5560498 |
Statements
Computing and minimizing the relative regret in combinatorial optimization with interval data (English)
0 references
2 June 2009
0 references
Minmax regret optimization
0 references
Robust optimization
0 references
Uncertainty
0 references
Interval data
0 references
Polynomial algorithm
0 references
0 references
0 references
0 references
0 references
0.8367089629173279
0 references
0.8248890042304993
0 references
0.8160050511360168
0 references
0.80507892370224
0 references
