Pages that link to "Item:Q1866135"
From MaRDI portal
The following pages link to The sample average approximation method applied to stochastic routing problems: a computational study (Q1866135):
Displayed 30 items.
- Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming (Q288402) (← links)
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities (Q296965) (← links)
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- Constrained shortest path with uncertain transit times (Q496598) (← links)
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
- Integrated supply chain planning under uncertainty using an improved stochastic approach (Q636501) (← links)
- Validation analysis of mirror descent stochastic approximation method (Q715058) (← links)
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
- Commitment under uncertainty: Two-stage stochastic matching problems (Q959814) (← links)
- A two-stage stochastic programming model for transportation network protection (Q960408) (← links)
- Sales and operations planning in systems with order configuration uncertainty (Q976366) (← links)
- Stochastic programming approach to optimization under uncertainty (Q995788) (← links)
- A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- The sample average approximation method for empty container repositioning with uncertainties (Q1926912) (← links)
- Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem (Q2018108) (← links)
- A smooth penalty-based sample average approximation method for stochastic complementarity problems (Q2346632) (← links)
- A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
- On sample size control in sample average approximations for solving smooth stochastic programs (Q2376122) (← links)
- The workload balancing problem at air cargo terminals (Q2432093) (← links)
- A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming (Q2434991) (← links)
- A sample average approximation method based on a D-gap function for stochastic variational inequality problems (Q2438415) (← links)
- A stochastic programming approach for supply chain network design under uncertainty (Q2484345) (← links)
- On complexity of multistage stochastic programs (Q2583700) (← links)
- Stochastic Shortest Path Problem with Delay Excess Penalty (Q2883605) (← links)
- Simulation-Based Optimality Tests for Stochastic Programs (Q3001269) (← links)
- Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation (Q3507704) (← links)