A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-013-0684-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041977479 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 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
