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

Technical Note—A Note on the Stochastic Shortest Route Problem

Author

Listed:
  • Jerzy Kamburowski

    (Institute of Organization and Management, Technical University, Wroclaw, Poland)

Abstract

An optimality index for choosing the shortest route in an acyclic, stochastic network has recently been proposed. The present note identifies certain anomalies in using that index and proposes another optimality index. The results of using these indices are compared in a simple example.

Suggested Citation

  • Jerzy Kamburowski, 1985. "Technical Note—A Note on the Stochastic Shortest Route Problem," Operations Research, INFORMS, vol. 33(3), pages 696-698, June.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:3:p:696-698
    DOI: 10.1287/opre.33.3.696
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.3.696
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.3.696?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. Karthik Natarajan & Dongjian Shi & Kim-Chuan Toh, 2014. "A Probabilistic Model for Minmax Regret in Combinatorial Optimization," Operations Research, INFORMS, vol. 62(1), pages 160-181, February.

    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:3:p:696-698. 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.