Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064)
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 7362310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties |
scientific article; zbMATH DE number 7362310 |
Statements
Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (English)
0 references
23 June 2021
0 references
worst-case linear optimization
0 references
successive convex optimization
0 references
convex relaxation
0 references
branch-and-bound
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8884999752044678
0 references
0.8862199783325195
0 references
0.8589798808097839
0 references
0.7258052825927734
0 references
0.7088800668716431
0 references
