On the complexity of minmax regret linear programming (Q1887882)
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 2117501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of minmax regret linear programming |
scientific article; zbMATH DE number 2117501 |
Statements
On the complexity of minmax regret linear programming (English)
0 references
22 November 2004
0 references
Combinatorial optimization
0 references
Complexity theory
0 references
Uncertainty modeling
0 references
Minmax regret optimization
0 references
0 references
0 references
0 references
0.8161289095878601
0 references
0.8069677352905273
0 references
0.8066413998603821
0 references
0.8043389916419983
0 references
