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

Parametric Network Flows

Author

Listed:
  • Edward Minieka

    (Quantitative Methods Department, University of Illinois, Chicago, Illinois)

Abstract

This paper considers a directed capacitated network in which the supply at each source node and the demand at each sink node is a linear function of a parameter t . It presents two algorithms that determine the range of values for the parameter t ; they correspond to the primal and dual linear-programming algorithms that solve this problem. The dual algorithm appears to have a simpler structure.

Suggested Citation

  • Edward Minieka, 1972. "Parametric Network Flows," Operations Research, INFORMS, vol. 20(6), pages 1162-1170, December.
    • Handle: RePEc:inm:oropre:v:20:y:1972:i:6:p:1162-1170
    DOI: 10.1287/opre.20.6.1162
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.20.6.1162
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.20.6.1162?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. Ravindra K. Ahuja & James B. Orlin, 1991. "Distance‐directed augmenting path algorithms for maximum flow and parametric maximum flow problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 413-430, June.
    2. Shiho Morishita & Takao Nishizeki, 2015. "Parametric power supply networks," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 1-15, January.

    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:20:y:1972:i:6:p:1162-1170. 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.