An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
DOI10.1016/J.EJOR.2013.09.048zbMATH Open1339.90255OpenAlexW1999410188MaRDI QIDQ296965FDOQ296965
Authors: Haiqing Song, Raymond K. Cheung, Hai-Yan Wang 
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.048
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
dynamic programmingstochastic programmingtransportationapproximate dynamic programmingdecomposition methodmultistage networks with random arc capacities
Dynamic programming (90C39) Stochastic programming (90C15) Stochastic network models in operations research (90B15)
Cites Work
- Modeling with stochastic programming.
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- A multicut algorithm for two-stage stochastic linear programs
- Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
- Introduction to Stochastic Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- The use of discrete moment bounds in probabilistic constrained stochastic programming models
- Linear programming under uncertainty
- The sample average approximation method applied to stochastic routing problems: a computational study
- A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Sublinear upper bounds for stochastic programs with recourse
- An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
- A successive convex approximation method for multistage workforce capacity planning problem with turnover
- A primal-dual decomposition algorithm for multistage stochastic convex programming
- SMART: A stochastic multiscale model for the analysis of energy resources, technology, and policy
- A piecewise linear upper bound on the network recourse function
- Solving stochastic programs with network recourse
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Tight Bounds for Stochastic Convex Programs
- Stochastic programs over trees with random arc capacities
- Conditional Stochastic Decomposition: An Algorithmic Interface for Optimization and Simulation
- 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
- An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
- Scenario generation and stochastic programming models for asset liability management
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)
