A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure

Authors:
Gregory D. Glockner;George L. Nemhauser
Affiliations:
-;-
Venue:
Operations Research
Year:
2000

Citing 0
Cited 3

Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results

Computational Optimization and Applications
A DSS for water resources management under uncertainty by scenario analysis

Environmental Modelling & Software
Integer equal flows

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a dynamic network flow problem where the arc capacities are random variables. This gives a multistage stochastic linear program. We describe the randomness using a multi-scenario approach. Because of the multilayered structure, there are several ways to decompose the linear program. We classify different decomposition schemes, and we develop a scheme calledcompath decomposition, which is derived from path decomposition for network flows. We give a polynomial-time algorithm to find a cheapest compath that can solve the subproblems resulting from compath decomposition. Finally, compath decomposition is extended to multicommodity flow problems.