# A network recourse decomposition method for dynamic networks with random arc capacities

@article{Powell1994ANR, title={A network recourse decomposition method for dynamic networks with random arc capacities}, author={Warren B. Powell and Raymond K.-M. Cheung}, journal={Networks}, year={1994}, volume={24}, pages={369-384} }

We study a class of two-stage dynamic networks with random arc capacities where the decisions in the first stage must be made before realizing the random quantities in the second stage. The expected total cost of the second stage is a function of the first-stage decisions, known as the expected recourse function, which is generally intractable. This paper proposes a new method to approximate the expected recourse function as a convex, separable function of the supplies to the second stage… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 24 CITATIONS

## An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management

VIEW 7 EXCERPTS

CITES BACKGROUND & METHODS

## Models and Algorithms for Distribution Problems with Uncertain Demands

VIEW 10 EXCERPTS

CITES METHODS

## An arc-exchange decomposition method for multistage dynamic networks with random arc capacities

VIEW 5 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers

VIEW 5 EXCERPTS

CITES METHODS & BACKGROUND

## EVP Terminal Report : Operations research for disaster preparedness and response Exchange Visitor :

VIEW 2 EXCERPTS

CITES BACKGROUND

## A Ranking Approach for Intuitionistic Fuzzy Numbers and its Application

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES