Flows in dynamic networks with aggregate arc capacities

https://doi.org/10.1016/j.ipl.2006.07.007Get rights and content

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.

References (7)

  • J.E. Aronson

    A survey of dynamic network flows

    Annals of Operations Research

    (1989)
  • Dahlgren Lab of U.S. Navy, Personal communications,...
  • L.R. Ford et al.

    Flows in Networks

    (1962)
There are more references available in the full text version of this article.

Cited by (15)

View all citing articles on Scopus
View full text