Computation of maximum flows in networks
Burns, William Charles
MetadataShow full item record
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.
RightsThis 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.
Showing items related by title, author, creator and subject.
Bassett, Robert; Sharpnack, James (ArXiv, 2018-12);In this paper we introduce a method for nonparametric density estimation on infrastructure networks. We define fused density estimators as solutions to a total variation regularized maximum-likelihood density estimation ...
Derbes, H. Dan (Monterey, California. Naval Postgraduate School, 1997-09);A network interdictor' has a limited supply of resource with which to disrupt a network user's" flow of supplies in a capacitated transshipment network. The interdictor's problem of minimizing the maximum flow through the ...
Bollmann, Chad A. (Monterey, California: Naval Postgraduate SchoolMonterey, California. Naval Postgraduate School, 2019-12); NPS-19-N039-AThe objectives of this work were to investigate the source of the dual natures of network traffic (i.e., Gaussian and alpha-stable) in order prove the merit of further development, improvement, and application of non-parametric ...