Accession Number : AD0675954

Title :   AN ALGORITHM FOR UNIVERSAL MAXIMAL DYNAMIC FLOWS IN A NETWORK,

Corporate Author : GEORGE WASHINGTON UNIV WASHINGTON D C LOGISTICS RESEARCH PROJECT

Personal Author(s) : Wilkinson,W. L.

Report Date : 14 AUG 1968

Pagination or Media Count : 31

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 is included which compares the temporally repeated and universal type solutions. (Author)

Descriptors :   (*LOGISTICS, *SCHEDULING), ALGORITHMS, OPTIMIZATION, NETWORKS, DYNAMIC PROGRAMMING, LINEAR PROGRAMMING, THEOREMS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE