IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Note---Some Equivalent Objectives for Dynamic Network Flow Problems

Listed author(s):
  • John J. Jarvis

    (Georgia Institute of Technology)

  • H. Donald Ratliff

    (Georgia Institute of Technology)

Registered author(s):

    Many important problems can be modeled as dynamic (time-expanded) network flow problems. For example, in building evacuation we might use twenty nodes to represent a room at 3 minute intervals over an hour, and use arcs to indicate the feasible passages, over time, among the various rooms. The purpose of this note is to demonstrate that it is possible to satisfy at least three important objectives simultaneously in a maximal dynamic network flow problem. These are (1) construction of an earliest arrival schedule (i.e., a solution which maximizes flow in the first p periods, for every p), (2) minimization of the period at which the last unit of flow arrives at the sink, and (3) minimization of the average time for all flow to arrive at the sink.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 28 (1982)
    Issue (Month): 1 (January)
    Pages: 106-109

    in new window

    Handle: RePEc:inm:ormnsc:v:28:y:1982:i:1:p:106-109
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:28:y:1982:i:1:p:106-109. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.