Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization (Q4609983)
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: Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization |
scientific article; zbMATH DE number 6853581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization |
scientific article; zbMATH DE number 6853581 |
Statements
27 March 2018
0 references
chance-constrained optimization
0 references
convex mixed-integer optimization
0 references
optimization with restricted variable values
0 references
randomized sampling algorithms
0 references
Helly-type theorems
0 references
S-optimization
0 references
convexity spaces
0 references
combinatorial convexity
0 references
math.MG
0 references
math.CO
0 references
math.OC
0 references
0 references
0 references
0 references
0 references
0.92383516
0 references
0.9095478
0 references
0.9046804
0 references
0.90231687
0 references
0.90126634
0 references
0.89933705
0 references
0.89869636
0 references
0.8976132
0 references
0.8908632
0 references
