Appraising Feasibility and Maximal Flow Capacity of a Network
Abstract
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 23, 1970
- Accession Number
- AD0715546
Entities
People
- Alan W. Mcmasters
Organizations
- Naval Postgraduate School