A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:29, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support |
scientific article |
Statements
A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (English)
0 references
29 August 2014
0 references
stochastic programming
0 references
integer programming
0 references
chance constraints
0 references
probabilistic constraints
0 references
decomposition
0 references
