An Algorithm for Universal Maximal Dynamic Flows in a Network

W. L. Wilkinson
Additional contact information
W. L. Wilkinson: The George Washington University, Washington, D.C.

Operations Research, 1971, vol. 19, issue 7, 1602-1612

Abstract: This paper presents a modification to the Ford-Fulkerson algorithm for maximal dynamic flow in a time-weighted, capacitated network. The modification is mild, as conjectured by Gale, and produces a shipping schedule representing what has been termed the universal maximal dynamic flow. The universal feature is that, in constructing a schedule for P periods, this same schedule is maximal when truncated to p less than P periods. A numerical example compares the temporally repeated and universal-type solutions.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.7.1602 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:7:p:1602-1612

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().