AN ALGORITHM FOR UNIVERSAL MAXIMAL DYNAMIC FLOWS IN A NETWORK,

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)

Document Details

Document Type
Technical Report
Publication Date
Aug 14, 1968
Accession Number
AD0675954

Entities

People

  • W. L. Wilkinson

Organizations

  • George Washington University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Freight Transportation
  • Marine Transportation
  • Mathematics
  • Shipping

Readers

  • Computer Engineering
  • Operations Research