Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ADMBB / rank | |||
Normal rank | |||
Revision as of 19:00, 28 February 2024
scientific article; zbMATH DE number 7362310
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
