BOUNDS FOR MAXIMAL TEMPORALLY REPEATED FLOWS IN A NETWORK.
Abstract
This paper is addressed to the capacitated transshipment problem. A Push/Pull Algorithm is described which is a variation of the Ford and Fulkerson Algorithm. Both algorithms solve either the minimal cost flow or maximal dynamic flow problem. A supplementary procedure, a Bounded Flow Algorithm, employs the Push/Pull Algorithm to determine the arc flow bounds for alternative optimal solutions. A theorem is offered concerning these bounds. The logic for the computer programs is described together with some observations on computing efficiency with network algorithms. The paper concludes with a network example and numerical results. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 19, 1968
- Accession Number
- AD0668174
Entities
People
- Donald J. Hunt
- W. L. Wilkinson
Organizations
- George Washington University