Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
From MaRDI portal
Recommendations
- Stochastic programs over trees with random arc capacities
- A network recourse decomposition method for dynamic networks with random arc capacities
- Restricted recourse strategies for bounding the expected network recourse function
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
Cited in
(13)- Planning models for freight transportation
- Restricted recourse strategies for bounding the expected network recourse function
- Inter-school bus scheduling under stochastic travel times
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
- Bounding procedures for multistage stochastic dynamic networks
- Stochastic programs over trees with random arc capacities
- A network recourse decomposition method for dynamic networks with random arc capacities
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
- Facets of the stochastic network flow problem
- On stochastic programs over trees with partially dependent arc capacities
- On the safe side of stochastic programming: bounds and approximations
- Stochastic air freight hub location and flight routes planning
This page was built for publication: Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291460)
