On the complexity of robust multi-stage problems with discrete recourse (Q6180695)
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 7782006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of robust multi-stage problems with discrete recourse |
scientific article; zbMATH DE number 7782006 |
Statements
On the complexity of robust multi-stage problems with discrete recourse (English)
0 references
2 January 2024
0 references
robust optimization
0 references
multi-stage optimization
0 references
robust adjustable optimization
0 references
robust recoverable optimization
0 references
polynomial hierarchy
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
0.8260824084281921
0 references
0.7794396877288818
0 references
0.778915524482727
0 references
0.7784026861190796
0 references
