Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems (Q2263338): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10559-014-9658-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974836546 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:00, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems |
scientific article |
Statements
Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems (English)
0 references
18 March 2015
0 references
stochastic programming
0 references
two-stage problems
0 references
quantile programming
0 references
probabilistic constraints
0 references
deterministic equivalent
0 references
mixed-integer optimization problems
0 references
discrete programming
0 references
