Minimal disconnecting sets in directed multi‐commodity networks

John J. Jarvis and John B. Tindall

Naval Research Logistics Quarterly, 1972, vol. 19, issue 4, 681-690

Abstract: The problem of finding minimal disconnecting sets for multi‐commodity directed networks may be solved using an arc‐path formulation and Gomory's all‐integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network.

Date: 1972
References: Add references at CitEc
Citations:

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

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:19:y:1972:i:4:p:681-690

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 ().