Pages that link to "Item:Q2688910"
From MaRDI portal
The following pages link to A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation (Q2688910):
Displaying 5 items.
- Experimental study on the efficiency and accuracy of a chance-constrained programming algorithm (Q789325) (← links)
- Analysis of a chance-constrained new product risk model with multiple customer classes (Q1991227) (← links)
- An exact decomposition algorithm for a chance-constrained new product risk model (Q2294311) (← links)
- A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
- A polynomial approximation-based approach for chance-constrained optimization (Q4646676) (← links)