Pages that link to "Item:Q1866135"

The following pages link to The sample average approximation method applied to stochastic routing problems: a computational study (Q1866135):

Displaying 34 items.

• Routing optimization with time windows under uncertainty (Q2414906) (← links)
• Influence maximization with deactivation in social networks (Q2424770) (← 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)
• When can we improve on sample average approximation for stochastic optimization? (Q2661521) (← links)
• Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints (Q2661625) (← links)
• An approach to the distributionally robust shortest path problem (Q2668652) (← links)
• Multi-modal cargo logistics distribution problem: decomposition of the stochastic risk-averse models (Q2668704) (← links)
• Railway disruption management: designing bus bridging services under uncertainty (Q2668706) (← 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)
• Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
• Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
• Kernel Entropy Discriminant Analysis for Dimension Reduction (Q5045350) (← links)
• On Feasibility of Sample Average Approximation Solutions (Q5116547) (← links)
• In Memoriam: Shabbir Ahmed (1969–2019) (Q5139620) (← links)
• Stochastic polynomial optimization (Q5210742) (← links)
• A smoothing projected HS method for solving stochastic tensor complementarity problem (Q6046866) (← links)
• The effect of few historical data on the performance of sample average approximation method for operating room scheduling (Q6056096) (← links)
• Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics (Q6065595) (← links)
• Evaluating appointment postponement in scheduling patients at a diagnostic clinic (Q6077327) (← links)
• Sample average approximation for risk-averse problems: a virtual power plant scheduling application (Q6114903) (← links)
• A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty (Q6114962) (← links)
• M-estimators for models with a mix of discrete and continuous parameters (Q6123490) (← links)
• Block mirror stochastic gradient method for stochastic optimization (Q6158991) (← links)
• An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation (Q6163589) (← links)
• Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty (Q6167875) (← links)
• Distributionally robust Weber problem with uncertain demand (Q6175466) (← links)
• A single cut proximal bundle method for stochastic convex composite optimization (Q6634524) (← links)