Accession Number:

AD0224376

Title:

A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1955-12-29

Pagination or Media Count:

26.0

Abstract:

A very simple algorithm for finding a maximal flow and minimal cut in a transportation network is described it is then applied to obtain an efficient computational routine for the Hitchcock distribution problem.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE