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

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

Author

Listed:
  • Eric V. Denardo

    (Yale University, New Haven, Connecticut)

  • Bennett L. Fox

    (University of Montreal, Montreal, Quebec)

Abstract

We present a new family of shortest-route methods, which reduce an upper bound on running time, and make empirical comparisons for a certain class of networks. These methods also allow for exploitation of structure by pruning arcs and/or nodes.

Suggested Citation

  • Eric V. Denardo & Bennett L. Fox, 1979. "Shortest-Route Methods: 1. Reaching, Pruning, and Buckets," Operations Research, INFORMS, vol. 27(1), pages 161-186, February.
    • Handle: RePEc:inm:oropre:v:27:y:1979:i:1:p:161-186
    DOI: 10.1287/opre.27.1.161
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.27.1.161
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.27.1.161?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. Le-Anh, T. & de Koster, M.B.M., 2004. "Real-Time Scheduling Approaches for Vehicle-Based Internal Transport Systems," ERIM Report Series Research in Management ERS-2004-056-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    3. Ann Campbell & Michel Gendreau & Barrett Thomas, 2011. "The orienteering problem with stochastic travel and service times," Annals of Operations Research, Springer, vol. 186(1), pages 61-81, June.
    4. Daniel Delling & Andrew V. Goldberg & Thomas Pajor & Renato F. Werneck, 2017. "Customizable Route Planning in Road Networks," Transportation Science, INFORMS, vol. 51(2), pages 566-561, May.

    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:27:y:1979:i:1:p:161-186. 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.