Premium
Viability analysis: A formulation aid for all classes of network models
Author(s) -
Chinneck John W.
Publication year - 1992
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199206)39:4<531::aid-nav3220390407>3.0.co;2-k
Subject(s) - interconnection , cover (algebra) , computer science , flow network , algorithm , network analysis , network model , mathematics , mathematical optimization , artificial intelligence , mechanical engineering , computer network , engineering , physics , quantum mechanics
Nonviable network models have edges which are forced to zero flow simply by the pattern of interconnection of the nodes. The original nonviability diagnosis algorithm [4] is extended here to cover all classes of network models, including pure, generalized, pure processing, nonconserving processing, and generalized processing. The extended algorithm relies on the conversion of all network forms to a pure processing form. Efficiency improvements to the original algorithm are also presented.