BOUNDS FOR MAXIMAL TEMPORALLY REPEATED FLOWS IN A NETWORK.
GEORGE WASHINGTON UNIV WASHINGTON D C LOGISTICS RESEARCH PROJECT
Pagination or Media Count:
This paper is addressed to the capacitated transshipment problem. A PushPull 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 PushPull 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
- Operations Research