Viability analysis: A formulation aid for all classes of network models

John W. Chinneck

Naval Research Logistics (NRL), 1992, vol. 39, issue 4, 531-543

Abstract: 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.

Date: 1992
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199206)39:43.0.CO;2-K

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:39:y:1992:i:4:p:531-543

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().