
Accession Number : AD0668174
Title : BOUNDS FOR MAXIMAL TEMPORALLY REPEATED FLOWS IN A NETWORK.
Descriptive Note : Scientific rept.,
Corporate Author : GEORGE WASHINGTON UNIV WASHINGTON D C LOGISTICS RESEARCH PROJECT
Personal Author(s) : Hunt,Donald J. ; Wilkinson,W. L.
Report Date : 19 MAR 1968
Pagination or Media Count : 93
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)
Descriptors : (*OPERATIONS RESEARCH, GRAPHICS), (*TRANSPORTATION, NETWORKS), (*FLOW CHARTING, NETWORKS), LOGISTICS, LINEAR PROGRAMMING, OPTIMIZATION, MANAGEMENT PLANNING AND CONTROL, SCHEDULING, COSTS, ALGORITHMS, COMPUTER PROGRAMMING, SUBROUTINES
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE