Accession Number:

AD0838959

Title:

COMPUTATION OF MAXIMUM FLOWS IN NETWORKS

Descriptive Note:

Master's thesis

Corporate Author:

NAVAL POSTGRADUATE SCHOOL MONTEREY CA

Personal Author(s):

• Burns, William C.

Report Date:

1968-06-01

Pagination or Media Count:

55.0

Abstract:

A review of the current theory and methods for the computation of maximum flow in networks is presented along with a simplified method for determination of a feasible flow in networks with upper and lower bounded arcs. A computational procedure is presented which is used to calculate the maximum flow for a general network. The network is reduced to an equivalent basic network. An associated network is used to compute a feasible, then the maximum flow for the basic network. A computer program is included for use in computation of maximal flows in large networks.

Descriptors:

• *TRANSPORTATION
• ALGORITHMS
• COMBINATORIAL ANALYSIS
• COMPUTER PROGRAMS
• FLOW CHARTING
• GRAPHICS
• NETWORKS
• OPTIMIZATION
• THESES

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE