Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
From MaRDI portal
Recommendations
Cited in
(15)- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- On the Bayesability of chance-constrained programming problems
- The search for information -- a patient perspective on multiple opinions
- Linear programming with stochastic processes as parameters as applied to production planning
- Survey of mathematical programming models in air pollution management
- Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint
- The information value and the uncertainties in two-stage uncertain programming with recourse
- Satisficing DEA models under chance constraints
- Parametric stochastic programming with one chance constraint: gaining insights from response space analysis
- A labeling method for dynamic driver-task assignment with uncertain task durations
- A stochastic improvement method for stochastic programming
- Modified chance constrained linear programming under uncertainty
- scientific article; zbMATH DE number 584483 (Why is no real title available?)
- The expected value of sampling information for linear decision problems with two actions under the (-E) model
- A stochastic geometric programming problem with multiplicative recourse
This page was built for publication: Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747239)