Efficient solution selection for two-stage stochastic programs
type: Item
instance of: scholarly article
title: Efficient solution selection for two-stage stochastic programs
zbMATH Open document ID: 1430.90442
author: Xin Fei
author: Nalân Gülpinar
author: Jürgen Branke
published in: European Journal of Operational Research
publication date: 2019-04-30T00:00:00Z
full work available at URL: http://wrap.warwick.ac.uk/113522/
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7049421
zbMATH Keywords: stochastic programming
zbMATH Keywords: sample average approximation
zbMATH Keywords: Wasserstein metric
zbMATH Keywords: ranking and selection
describes a project that uses: SUTIL
MaRDI profile type: Publication
OpenAlex ID: W2914468865
cites work: A two-stage stochastic programming framework for transportation planning in disaster response
cites work: Q3229784
cites work: A two-stage stochastic programming model for electric energy producers
cites work: A multicut algorithm for two-stage stochastic linear programs
cites work: Selecting a Selection Procedure
cites work: A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
cites work: Linear programming under uncertainty
cites work: Decomposition Principle for Linear Programs
cites work: Real Analysis and Probability
cites work: Portfolio optimization via stochastic programming: Methods of output analysis
cites work: Scenario reduction in stochastic programming
cites work: Solution sensitivity-based scenario reduction for stochastic unit commitment
cites work: Simulation and optimization approaches to scenario tree generation
cites work: Are quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?
cites work: A note on scenario reduction for two-stage stochastic programs
cites work: Scenario tree reduction for multistage stochastic programs
cites work: A heuristic for moment-matching scenario generation
cites work: Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint
cites work: The sample average approximation method for stochastic discrete optimization
cites work: A general framework on the simulation-based optimization under fixed computing budget
cites work: Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
cites work: The empirical behavior of sampling methods for stochastic programming
cites work: Decomposition algorithms for stochastic programming on a computational grid
cites work: A two-stage stochastic programming model for transportation network protection
cites work: Q3809581
cites work: Monte Carlo bounding techniques for determinig solution quality in stochastic programs
cites work: Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
cites work: Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
cites work: Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach
cites work: Scenario tree generation for multiperiod financial optimization of optimal discretization
cites work: The Benders decomposition algorithm: a literature review
cites work: Accelerating the regularized decomposition method for two stage stochastic linear problems
cites work: A stochastic programming approach for supply chain network design under uncertainty
cites work: A simulation-based approach to two-stage stochastic programming with recourse
cites work: Conditioning of convex piecewise linear stochastic programs
cites work: A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
cites work: Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Programming under uncertainty: The complete problem
cites work: Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
cites work: MO2TOS: Multi-Fidelity Optimization with Ordinal Transformation and Optimal Sampling
DOI: 10.1016/J.EJOR.2019.02.015
description: scientific article; zbMATH DE number 7049421