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

Letter to the Editor---The Maximum Capacity Through a Network

Author

Listed:
  • Maurice Pollack

    (Stanford Research Institute, Menlo Park, California)

Abstract

The maximum capacity route is defined to be the route between any two given cities (nodes) that allows the greatest flow. This differs from the maximum capacity problem [1] in that only the single best route is desired, in the maximum capacity problem, the object is to find the maximum flow between two nodes using as many different routes as needed. The maximum capacity route problem arises in automatic teletype networks where, for any given origin-destination pair, there is only one route specified.

Suggested Citation

  • Maurice Pollack, 1960. "Letter to the Editor---The Maximum Capacity Through a Network," Operations Research, INFORMS, vol. 8(5), pages 733-736, October.
    • Handle: RePEc:inm:oropre:v:8:y:1960:i:5:p:733-736
    DOI: 10.1287/opre.8.5.733
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.8.5.733
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.8.5.733?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. Erhan Erkut & Armann Ingolfsson, 2000. "Catastrophe Avoidance Models for Hazardous Materials Route Planning," Transportation Science, INFORMS, vol. 34(2), pages 165-179, May.
    2. Yingying Kang & Rajan Batta & Changhyun Kwon, 2014. "Value-at-Risk model for hazardous material transportation," Annals of Operations Research, Springer, vol. 222(1), pages 361-387, November.
    3. Calvete, Herminia I. & del-Pozo, Lourdes & Iranzo, José A., 2018. "Dealing with residual energy when transmitting data in energy-constrained capacitated networks," European Journal of Operational Research, Elsevier, vol. 269(2), pages 602-620.
    4. S. Ardizzoni & L. Consolini & M. Laurini & M. Locatelli, 2022. "Shortest path with acceleration constraints: complexity and approximation algorithms," Computational Optimization and Applications, Springer, vol. 83(2), pages 555-592, November.
    5. Fredrik Ljunggren & Kristian Persson & Anders Peterson & Christiane Schmidt, 2021. "Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path," Public Transport, Springer, vol. 13(3), pages 597-623, October.
    6. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.

    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:8:y:1960:i:5:p:733-736. 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.