Appraising feasibility and maximal flow capacity of a network
By: by Alan W. McMasters
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1970
Place of publication: Monterey, California
Language: eng
Number of pages: 19
Subjects: Network analysis (Planning); Operations research
Description: The use of the dual graph in determining the value of the maximal flow capacity of an undirected network has been extended to directed networks. A directed dual graph is defined such that the length of the shortest route through this dual is equal to the maximal flow capacity of its directed primal. Feasibility of a specified exogenous flow for networks having positive lower bounds on arc flows can also be appraised. Infeasibility is indicated by a dual cycle of negative length. (Author)
Notes: Title from cover.

"23 October 1970"--Cover.

"NPS-55MG70101A"--Cover.

DTIC Identifiers: Network flows, shortest route problem, graphs.

Author(s) key words: Network flows, graph theory, feasibility, optimization.

Includes bibliographical references (p. 16).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1970.