IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v19y1972i4p681-690.html
   My bibliography  Save this article

Minimal disconnecting sets in directed multi‐commodity networks

Author

Listed:
  • John J. Jarvis
  • John B. Tindall

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.

Suggested Citation

  • John J. Jarvis & John B. Tindall, 1972. "Minimal disconnecting sets in directed multi‐commodity networks," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 19(4), pages 681-690, December.
    • Handle: RePEc:wly:navlog:v:19:y:1972:i:4:p:681-690
    DOI: 10.1002/nav.3800190408
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800190408
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800190408?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:19:y:1972:i:4:p:681-690. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.