<div class="description">
<dl><dd>Title from cover</dd>
<dd>"23 October 1970"--Cover</dd>
<dd>"NPS-55MG70101A"--Cover</dd>
<dd>DTIC Identifiers: Network flows, shortest route problem, graphs</dd>
<dd>Author(s) key words: Network flows, graph theory, feasibility, optimization</dd>
<dd>Includes bibliographical references (p. 16)</dd>
<dd>Technical report; 1970</dd>
<dd>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)</dd></dl><br>Subjects: NATIONAL SECURITY.; ECONOMETRICS.</div>
<div class="fn value">
McMasters, Alan W.</div>
Internet Archive identifier