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):
Displaying 50 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)
- A maritime inventory routing problem with stochastic sailing and port times (Q337582) (← links)
- New reformulations of distributionally robust shortest path problem (Q342487) (← 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)
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← 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)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- A two-step gradient estimation approach for setting supply chain operating parameters (Q1651591) (← links)
- Flexible solutions to maritime inventory routing problems with delivery time windows (Q1652459) (← links)
- Managing congestion in a multi-modal transportation network under biomass supply uncertainty (Q1730690) (← links)
- A hybrid heuristic for a stochastic production-inventory-routing problem (Q1742254) (← links)
- Whole blood or apheresis donations? A multi-objective stochastic optimization approach (Q1754076) (← links)
- Itinerary planning with time budget for risk-averse travelers (Q1754240) (← links)
- The sample average approximation method for empty container repositioning with uncertainties (Q1926912) (← links)
- A stochastic programming model for service scheduling with uncertain demand: an application in open-access clinic scheduling (Q1981952) (← links)
- Stochastic global optimization using tangent minorants for Lipschitz functions (Q1989202) (← links)
- A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
- Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem (Q2018108) (← links)
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels (Q2030456) (← links)
- A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
- Scheduling deferrable electric appliances in smart homes: a bi-objective stochastic optimization approach (Q2130061) (← links)
- Multi-commodity distribution under uncertainty in disaster response phase: model, solution method, and an empirical study (Q2158046) (← links)
- Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel (Q2173180) (← links)
- An ADMM algorithm for two-stage stochastic programming problems (Q2178363) (← links)
- Enhancing Benders decomposition algorithm to solve a combat logistics problem (Q2178915) (← links)
- Optimal insurance contract specification in the upstream sector of the oil and gas industry (Q2239920) (← links)
- Spare parts inventory routing problem with transshipment and substitutions under stochastic demands (Q2240378) (← links)
- A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
- Liner ship bunkering and sailing speed planning with uncertain demand (Q2301031) (← links)
- Wasserstein distributionally robust shortest path problem (Q2301929) (← links)
- Multi-echelon supply chain design considering unreliable facilities with facility hardening possibility (Q2306779) (← 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)
