IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v12y1964i5p680-688.html
   My bibliography  Save this article

Sensitivity Analysis of Multiterminal Flow Networks

Author

Listed:
  • Salah E. Elmaghraby

    (Department of Industrial Administration, Yale University)

Abstract

Given an undirected flow network with finite arc capacities, an algorithm is developed for the determination of the effect of a reduction (or increase) in the capacity of any arc on the maximum flow between any two nodes of the network. The algorithm is based on the Gomory-Hu construction of “cut-trees.”

Suggested Citation

  • Salah E. Elmaghraby, 1964. "Sensitivity Analysis of Multiterminal Flow Networks," Operations Research, INFORMS, vol. 12(5), pages 680-688, October.
    • Handle: RePEc:inm:oropre:v:12:y:1964:i:5:p:680-688
    DOI: 10.1287/opre.12.5.680
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.12.5.680
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.12.5.680?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. João Paulo Freitas Araujo & Madiagne Diallo & Fernanda Maria Pereira Raupp & Pascal Berthomé & José Eugenio Leal, 2020. "Parametric analysis on cut-trees and its application on a protein clustering problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 229-249, March.
    2. Ahmad Hosseini & Bita Kabir Baiki, 2017. "An Addendum on Postoptimality of Maximally Reliable Path," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 9(3), pages 23-29, June.

    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:inm:oropre:v:12:y:1964:i:5:p:680-688. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.