A network recourse decomposition method for dynamic networks with random arc capacities
- 1 October 1994
- Vol. 24 (7), 369-384
- https://doi.org/10.1002/net.3230240703
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with RecourseMathematics of Operations Research, 1991
- Scenarios and Policy Aggregation in Optimization Under UncertaintyMathematics of Operations Research, 1991
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation ProblemsTransportation Science, 1990
- Bounding the expected time-cost curve for a stochastic pert network from belowOperations Research Letters, 1989
- Sublinear upper bounds for stochastic programs with recourseMathematical Programming, 1989
- A piecewise linear upper bound on the network recourse functionMathematical Programming, 1987
- Solving stochastic programs with network recourseNetworks, 1986
- An alternating method for stochastic linear programming with simple recourseMathematical Programming Studies, 1986
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic ProgrammingSIAM Journal on Applied Mathematics, 1969
- Programming Under Uncertainty: The Equivalent Convex ProgramSIAM Journal on Applied Mathematics, 1966