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

A Decomposition Algorithm for Shortest Paths in a Network

Author

Listed:
  • T. C. Hu

    (The University of Wisconsin, Madison, Wisconsin)

Abstract

Given an n -node network with lengths associated with arcs: the problem is to find the shortest paths between every pair of nodes in the network. If the network has less than n ( n − 1) arcs, then it is possible to treat parts of the network at a time and then get the shortest paths between every pair of nodes. This decomposition algorithm saves the amount of computation as well as the storage requirement of a computer.

Suggested Citation

  • T. C. Hu, 1968. "A Decomposition Algorithm for Shortest Paths in a Network," Operations Research, INFORMS, vol. 16(1), pages 91-102, February.
    • Handle: RePEc:inm:oropre:v:16:y:1968:i:1:p:91-102
    DOI: 10.1287/opre.16.1.91
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.16.1.91
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.16.1.91?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. I-Lin Wang & Ellis L. Johnson & Joel S. Sokol, 2005. "A Multiple Pairs Shortest Path Algorithm," Transportation Science, INFORMS, vol. 39(4), pages 465-476, November.
    2. Heinemann, Hergen H., 1971. "Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme [A General Decomposition Algorithm for Linear Optimization Problems]," MPRA Paper 28842, University Library of Munich, Germany.

    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:16:y:1968:i:1:p:91-102. 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.