Computation of maximum flows in networks
Authors
Burns, William Charles
Advisors
Greenberg, Harold
Second Readers
Subjects
Date of Issue
1968-06
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
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.
Type
Thesis
Description
Series/Report No
Department
Operations Research
Organization
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.