Flows in dynamic networks with aggregate arc capacities

Authors:
Vardges Melkonian
Affiliations:
Department of Mathematics, Ohio University, Athens, OH
Venue:
Information Processing Letters
Year:
2007

Citing 3
Cited 1

A survey of dynamic network flows

Annals of Operations Research
The Quickest Transshipment Problem

Mathematics of Operations Research
Flows over time with load-dependent transit times

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

An FPTAS for flows over time with aggregate arc capacities

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic flow problems, called bridge problem. The bridge problem has practical importance and raises interesting theoretical issues. We show that the bridge problem is NP-complete. Traditional static flow techniques for solving dynamic flow problems do not extend to the new problem. We give a linear programming formulation for the bridge problem which is based on the time-expanded network of the original dynamic network.