Minimax trees, paths, and cut sets

H. W. Corley and H. Golnabi

Naval Research Logistics Quarterly, 1983, vol. 30, issue 4, 665-666

Abstract: The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented.

Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800300411

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:navlog:v:30:y:1983:i:4:p:665-666

Access Statistics for this article

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