Accession Number:

AD0606376

Title:

CONSTRUCTION OF MAXIMAL DYNAMIC FLOWS IN NETWORKS

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1957-05-07

Pagination or Media Count:

13.0

Abstract:

This note describes briefly an algorithm for solving the following problem. Suppose given a network linear graph in which each link has associated with it two positive integers, one a commodity flow capacity, the other a traversal time. Assuming that some node of the network is a source for the commodity, another a sink, and the remaining may either transship the commodity immediately on receipt or hold for later shipment, what is the maximal amount that can be shipped from source to sink in any given number of time periods. No proofs are given.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE