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

A New Polynomially Bounded Shortest Path Algorithm

Author

Listed:
  • F. Glover

    (University of Colorado, Boulder, Colorado)

  • D. Klingman

    (University of Texas, Austin, Texas)

  • N. Phillips

    (University of Texas, Austin, Texas)

Abstract

This paper develops a new polynomially bounded shortest path algorithm, called the partitioning shortest path (PSP) algorithm, for finding the shortest path from one node to all other nodes in a network containing no cycles with negative lengths. This new algorithm includes as variants the label setting algorithm, many of the label correcting algorithms, and the apparently computationally superior threshold algorithm.

Suggested Citation

  • F. Glover & D. Klingman & N. Phillips, 1985. "A New Polynomially Bounded Shortest Path Algorithm," Operations Research, INFORMS, vol. 33(1), pages 65-73, February.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:1:p:65-73
    DOI: 10.1287/opre.33.1.65
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.1.65
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.1.65?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. Ziliaskopoulos, Athanasios K. & Mandanas, Fotios D. & Mahmassani, Hani S., 2009. "An extension of labeling techniques for finding shortest path trees," European Journal of Operational Research, Elsevier, vol. 198(1), pages 63-72, October.
    2. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    3. Nachtigall, K., 1995. "Time depending shortest-path problems with applications to railway networks," European Journal of Operational Research, Elsevier, vol. 83(1), pages 154-166, May.
    4. Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.

    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:33:y:1985:i:1:p:65-73. 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.