An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
From MaRDI portal
(Redirected from Publication:296965)
Recommendations
- 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
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
- Stochastic programs over trees with random arc capacities
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
- A multicut algorithm for two-stage stochastic linear programs
- A network recourse decomposition method for dynamic networks with random arc capacities
- A piecewise linear upper bound on the network recourse function
- A primal-dual decomposition algorithm for multistage stochastic convex programming
- A successive convex approximation method for multistage workforce capacity planning problem with turnover
- A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Conditional Stochastic Decomposition: An Algorithmic Interface for Optimization and Simulation
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Introduction to Stochastic Programming
- Linear programming under uncertainty
- Modeling with stochastic programming.
- Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
- SMART: A stochastic multiscale model for the analysis of energy resources, technology, and policy
- Scenario generation and stochastic programming models for asset liability management
- Solving stochastic programs with network recourse
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Stochastic programs over trees with random arc capacities
- Sublinear upper bounds for stochastic programs with recourse
- The sample average approximation method applied to stochastic routing problems: a computational study
- The use of discrete moment bounds in probabilistic constrained stochastic programming models
- Tight Bounds for Stochastic Convex Programs
Cited in
(3)
This page was built for publication: An arc-exchange decomposition method for multistage 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 Q296965)
