Time-varying universal maximum flow problems

  • Cai X
  • Sha D
  • Wong C
  • 1

    Readers

    Mendeley users who have this article in their library.
  • 5

    Citations

    Citations of this article.

Abstract

We consider a time-varying network without parallel arcs and loops, where a flow must take a certain time to traverse an arc. The transit time on an arc and the capacity of an arc are all time-varying parameters, which depend on the departure time to traverse the arc. To depart at the best time, a flow can wait at the beginning vertex of an arc, which is however limited by a time-varying vertex capacity. All those parameters, namely, the transit time, the arc capacity, and the vertex capacity, are discrete functions of time t. The problem is to find an optimal solution to send the maximum flow from the source vertex to the sink vertex, within a given time T. Moreover, we address the so-called universal maximum flow problem, which is to find a solution that remains optimal when the time limit T is truncated to any t ≤ T. We consider three variants of the problem, with waiting at a vertex being arbitrarily allowed, strictly prohibited, and bounded, respectively. Relevant algorithms are proposed, which can find optimal solutions in pseudopolynomial time. © 2001 Elsevier Science Ltd.

Author-supplied keywords

  • Algorithms
  • Computational complexity
  • Network programming
  • Time-varying networks
  • Universal maximum flow

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • X. Cai

  • D. Sha

  • C. K. Wong

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free