IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v8y1974i1p3-12.html
   My bibliography  Save this article

A Note on Finding All Shortest Paths

Author

Listed:
  • Fred Glover

    (University of Colorado, Boulder, Colorado)

  • D. Klingman

    (University of Texas, Austin, Texas)

  • A. Napier

    (Continental Oil Company, Houston, Texas)

Abstract

We present a procedure for finding the shortest routes between all pathconnected ordered pairs of nodes in a network. Furthermore, our approach is quite simple and highly efficient for a special class of network problems. In particular, this class of networks subsumes a number that appear in real world applications. For instance, the Polish government and the Texas Water Resources Developmental Board have developed water resource analysis models that are in this class.

Suggested Citation

  • Fred Glover & D. Klingman & A. Napier, 1974. "A Note on Finding All Shortest Paths," Transportation Science, INFORMS, vol. 8(1), pages 3-12, February.
    • Handle: RePEc:inm:ortrsc:v:8:y:1974:i:1:p:3-12
    DOI: 10.1287/trsc.8.1.3
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.8.1.3
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.8.1.3?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:inm:ortrsc:v:8:y:1974:i:1:p:3-12. 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.